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.

Back to listJan 21, 2026 13:48Johan SannemoJohan SannemoError
Source Code

Source code access is restricted. Log in to request access.

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 14:16M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 14:44011,187,82301,951,0002,121,728expected "6442459076 ", got "2147486898 "
2May 17, 2026 14:44010,697,36001,910,0002,121,728expected "6442459076 ", got "2147486898 "
3May 17, 2026 14:44011,416,22801,886,0002,121,728expected "6442459076 ", got "2147486898 "
4Jan 21, 2026 13:508,90523,249,2246,717,0001,119,0002,498,560
5Jan 21, 2026 13:488,99430,238,6966,926,000989,0002,281,472
6Jan 21, 2026 13:508,99830,602,5555,939,0001,979,0002,502,656
7Jan 21, 2026 13:489,00024,024,9044,950,0002,970,0002,494,464
8Jan 21, 2026 13:509,00024,642,6486,930,000990,0002,494,464
9Jan 21, 2026 13:489,08827,740,7054,998,0002,999,0002,502,656