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 01:51zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 05:19M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 05:1908,251,4681,094,00002,113,536expected "6442459076 ", got "2305422362 "
2May 17, 2026 05:19014,851,7441,003,00002,113,536expected "6442459076 ", got "2305422362 "
3May 17, 2026 05:1908,987,9141,092,00002,113,536expected "6442459076 ", got "2305422362 "
4Feb 20, 2026 01:513,31523,555,7352,917,00002,441,216
5Feb 20, 2026 01:513,33118,696,9291,954,000977,0002,441,216
6Feb 20, 2026 01:513,37618,666,4191,981,000990,0002,535,424