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

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 06:37M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 06:3708,319,5811,033,00002,113,536expected "6442459076 ", got "2305422362 "
2May 17, 2026 06:3708,391,001987,00002,113,536expected "6442459076 ", got "2305422362 "
3May 17, 2026 06:3708,251,2991,039,00002,113,536expected "6442459076 ", got "2305422362 "
4Feb 7, 2026 03:173,40622,356,7361,998,000999,0002,351,104
5Feb 7, 2026 03:173,41020,350,6672,001,0001,000,0002,342,912
6Feb 7, 2026 03:173,48819,680,1822,046,0001,023,0002,351,104