@@ -2,5 +2,6 @@ CXXFLAGS += -std=c++11

 CXXFLAGS += -Wall -Wextra -Wpedantic

 CXXFLAGS += -Wconversion

 # CXXFLAGS += -Wsign-conversion

+CXXFLAGS += -O3

 maze:

@@ -10,7 +10,7 @@ Features:

     -   Hunt And Kill

         -   Handles mazes of any size

         -   Random with seed (time in seconds since the epoch by default)

-        -   Fairly naive

+        -   Fairly slow (1000*1000 cells in ~4000ms)

 [`cxx-maze`]: https://git.rcrnstn.net/rcrnstn/cxx-maze

@@ -18,6 +18,8 @@ Features:

 ```

 $ make

+$ ./maze dummy

+3844ms

 $ ./maze

 ██  ████████████████████████████████████████████████████████████████████████████

 ██  ██                          ██              ██      ██          ██      ████

@@ -106,13 +106,23 @@ Maze hunt_and_kill(int w, int h, unsigned seed, C callback = [](Maze &){})

     return maze;

 }

-int main()

+int main(int argc, char const * [])

 {

     using namespace std::chrono;

-    auto seed = (unsigned)std::time(nullptr);

-    auto maze = hunt_and_kill(80/2, 24-1, seed, [](Maze & maze) {

+    if (argc == 1)

+    {

+        auto seed = (unsigned)std::time(nullptr);

+        auto maze = hunt_and_kill(80/2, 24-1, seed, [](Maze & maze) {

+            maze.print();

+            std::this_thread::sleep_for(milliseconds(20));

+        });

         maze.print();

-        std::this_thread::sleep_for(milliseconds(20));

-    });

-    maze.print();

+    }

+    else

+    {

+        auto const t1 = steady_clock::now();

+        hunt_and_kill(1000, 1000, 0);

+        auto const t2 = steady_clock::now();

+        std::cout << duration_cast<milliseconds>(t2 - t1).count() << "ms\n";

+    }

 }