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 22, 2026 03:15zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 07:14M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 07:14010,422,1011,098,00002,113,536expected "6442459076 ", got "2305422578 "
2May 17, 2026 07:1409,571,6661,024,00002,113,536expected "6442459076 ", got "2305422578 "
3May 17, 2026 07:14010,394,5751,099,00002,113,536expected "6442459076 ", got "2305422578 "
4Jan 22, 2026 03:153,46516,159,5582,033,0001,016,0002,359,296
5Jan 22, 2026 03:153,49519,933,6892,051,0001,025,0002,355,200
6Jan 22, 2026 03:153,63215,923,2972,131,0001,065,0002,359,296