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

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 07:16M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 07:1608,823,9901,165,00002,113,536expected "6442459076 ", got "2305422578 "
2May 17, 2026 07:16010,428,1931,173,00002,113,536expected "6442459076 ", got "2305422578 "
3May 17, 2026 07:1608,279,3521,165,00002,113,536expected "6442459076 ", got "2305422578 "
4Jan 22, 2026 03:563,48419,232,2942,044,0001,022,0002,355,200
5Jan 22, 2026 03:563,50617,399,5082,057,0001,028,0002,277,376
6Jan 22, 2026 03:564,34018,294,7023,819,00002,531,328