Hi. Your comment is visible from the main page to other users who have not yet solved the kata (like me). Please add a spoiler flag next time you post code or make a thorough comment of a solution.

This kata was great !
Would you happen to know some other cool katas with performance constraints ?

Nan, j'ai juste créé une méthode d'extension pour avoir une syntaxe fluent.

T'as réimplémenté Join pour le fun ? :D

Same here, dealing with two dimensional arrays in C# is unpleasant.
I think also the actual and expected values are to be switched :D

I still have this only one test failing showing:
Expected: -267383598
But was: 9828066929
or
Expected: -1030890533
But was: 9889935162

Putting the test in the try-catch clause does not make a fix for that test :P
Do we want the overflow to happen? if so, why?

Great kata !
I had a really fun time searching for a solution that would make this damn random test pass and I found some great algorithms.
Beware of integer overflows :)

Same issue here, worked on my machine and failed for 450010, and thanks to you I changed :math.pow(n,3) |> round to nnn
I guess this is part of the difficulty : you have to know every nook and cranny of the language you use :)