Closed lucaspbordignon closed 6 years ago
Simply makes the multiplication of every pair of three digits (100 to 999), find the palindromes and get the maximum of them, using some functional programming ideas.
100 to 999
Benchmark
Real time: 3.928 s User time: 6.255 s Sys. time: 0.394 s CPU share: 169.29 % Exit code: 0
How the solution works
Simply makes the multiplication of every pair of three digits (
100 to 999), find the palindromes and get the maximum of them, using some functional programming ideas.Performance
Benchmark