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

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 13:01M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 13:02012,706,43501,850,0002,121,728expected "6442459076 ", got "2147489798 "
2May 17, 2026 13:02012,920,48301,919,0002,121,728expected "6442459076 ", got "2147489798 "
3May 17, 2026 13:02012,631,32801,956,0002,121,728expected "6442459076 ", got "2147489798 "
4Jan 21, 2026 14:018,65227,695,2455,439,0002,175,0002,285,568
5Jan 21, 2026 14:018,79926,937,7985,531,0002,212,0002,502,656
6Jan 21, 2026 14:018,84325,299,4206,671,0001,111,0002,285,568