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 listFeb 20, 2026 00:41zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 07:13M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 07:1308,211,1461,011,00002,113,536expected "6442459076 ", got "2305422362 "
2May 17, 2026 07:13010,011,6491,016,00002,113,536expected "6442459076 ", got "2305422362 "
3May 17, 2026 07:1308,254,0011,099,00002,113,536expected "6442459076 ", got "2305422362 "
4Feb 20, 2026 00:413,48918,509,1692,047,0001,023,0002,437,120
5Feb 20, 2026 00:413,49117,867,9542,048,0001,024,0002,535,424
6Feb 20, 2026 00:413,57016,785,9902,095,0001,047,0002,428,928