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 23, 2026 04:31zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 12:54M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 12:5709,641,3741,977,00002,113,536expected "6442459076 ", got "2305422578 "
2May 17, 2026 12:57010,235,0491,133,00002,113,536expected "6442459076 ", got "2305422578 "
3May 17, 2026 12:5708,961,3861,197,00002,113,536expected "6442459076 ", got "2305422578 "
4Jan 23, 2026 04:313,55316,583,6732,085,0001,042,0002,359,296
5Jan 23, 2026 04:313,56018,847,3582,089,0001,044,0002,531,328
6Jan 23, 2026 04:313,56418,035,7792,091,0001,045,0002,359,296