FrankKair / polyglot-euler

📜 Project Euler solutions in various programming languages
MIT License
74 stars 14 forks source link

Elixir 145 #33

Closed fredericojordan closed 6 years ago

fredericojordan commented 6 years ago

How the solution works

Simple naïve solution. First defines reversible numbers then runs through all numbers from 1 to 1_000_000_000 while filtering and counting the reversibles.

Performance

Unfortunately this is takes a while to compute, indicating that it is very poorly optimized. Took 30 min on my machine. Couldn't set up a repl link for timeout reasons.

real    30m32.579s
user    29m59.152s
sys     0m10.540s