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 20, 2026 16:10Johan SannemoJohan SannemoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 12:50M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 12:53012,613,90701,943,0002,121,728expected "6442459076 ", got "2147487758 "
2May 17, 2026 12:53013,772,30701,880,0002,121,728expected "6442459076 ", got "2147487758 "
3May 17, 2026 12:53019,389,96302,197,0002,121,728expected "6442459076 ", got "2147487758 "
4Jan 20, 2026 16:108,67326,128,8496,542,0001,090,0002,490,368
5Jan 20, 2026 16:108,69722,116,3236,560,0001,093,0002,285,568
6Jan 20, 2026 16:108,71127,161,5255,476,0002,190,0002,502,656