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 19, 2026 13:04zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 05:18M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 05:1808,814,3401,014,00002,113,536expected "6442459076 ", got "2305422362 "
2May 17, 2026 05:1808,789,5751,101,00002,113,536expected "6442459076 ", got "2305422362 "
3May 17, 2026 05:18010,083,3921,115,00002,113,536expected "6442459076 ", got "2305422362 "
4Feb 19, 2026 13:043,32519,615,8631,951,000975,0002,277,376
5Feb 19, 2026 13:043,32818,594,8192,929,00002,424,832
6Feb 19, 2026 13:043,34823,019,0691,964,000982,0002,437,120