In Java i find it imposible to do the large number part, because its bigger than the range of long

Haskell fork

• Submission test input range expanded to make $O(n^2)$ solutions fail.

The C# reference solution returns different results compared to other languages.

level = 11, score = 32
Test Failed
  Expected: 161
  But was:  166

Possible Java translation

Fixed description merge problems of Clojure Translation by a deleted user.

Python new test framework required.

Haskell translation

Description should be language-agnostic

C, C++, Objective-C, possibly NASM: random tests generate 63-bit numbers which can be very unfavorable and result in unsolvable inputs, and, as a result, timeouts (they can't be handled even by reference solution). Upper bounds of inputs should be either unified between languages, or inputs sohuld be guaranteed to be solvable.

Objective-C: while generating random inputs, random tests call srand in a tight loop and as a result they generate 40 identical inputs.

C++: due to incorrect use of random utilities, the RNG is reseeded in a tight loop, and random tests generate 40 identical inputs. srand/rand combo shold be replaced with properly used <random> utilities.

C Translation (author inactive).

Pretty sure that the JS random tests are not correct..

In some cases it expects true for non-prime numbers (for example 992237) and the oposite as well (for example 373)

Lua translation!