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 14:02Johan SannemoJohan SannemoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 07:40M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 07:41011,272,89701,861,0002,121,728expected "6442459076 ", got "2147484645 "
2May 17, 2026 07:41011,901,36301,850,0002,121,728expected "6442459076 ", got "2147484645 "
3May 17, 2026 07:41010,770,37001,856,0002,121,728expected "6442459076 ", got "2147484645 "
4Jan 21, 2026 14:028,58423,758,5596,475,0001,079,0002,281,472
5Jan 21, 2026 14:028,62028,598,3216,503,0001,083,0002,285,568
6Jan 21, 2026 14:028,71827,135,2175,480,0002,192,0002,281,472