Sum of prime numbers Andrey Tsvetkov

Compute the sum of all prime numbers in a stream of binary integers as fast as possible.

Input: 1 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of all values that are prime, printed as a decimal string.

A generator is a program that produces test data and expected results for a challenge. Each time a solution is checked, the generator runs fresh - producing unique, unpredictable input.

Custom generators let you challenge other participants' solutions with your own test cases. If someone's solution fails on your generator's input, it exposes weaknesses in their approach. Writing good generators requires deep understanding of the problem - you need to craft edge cases, stress tests, and tricky inputs that push solutions to their limits.

Log in to create generators.