I decided to go the long way, and then saw this. Hurray, i learned somthing new

ahhaha, i spent about a 20 minutes for solution, and then a saw it.

Not to mention the performance characteristics on finite lists.

O(n) is possible, why vote an O(n log n) solution Best Practice?

C# was approved 9 years ago. At that time most translations and kata were not reviewed properly. There is an open issue about this kata: https://github.com/codewars/content-issues/issues/206

Understood. But why was C# approved? It has System.Numerics.BigInteger.

Rejected:

• No random tests
• This kata should not be translated to OCaml because OCaml supports big integer arithmetic (Zarith library).

instant facepalm when I saw this

10/10

how come, I didnt even know this method existed.

You missed the "non-negative integers" requirement.

Lmao my jaw dropped when I saw this. Never knew this existed.

i also laughed when i saw this solution because i over complicated mine like maniac

Had no idea this existed! that's a clever and funny solution!

Gotta be honest, I don't have a clue for what is happening here. Can someone explain me why this works as a solution?