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

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 06:53M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 06:53010,349,6321,253,00002,113,536expected "6442459076 ", got "2305422625 "
2May 17, 2026 06:5308,765,0031,040,00002,113,536expected "6442459076 ", got "2305422625 "
3May 17, 2026 06:53010,218,5581,124,00002,113,536expected "6442459076 ", got "2305422625 "
4Jan 17, 2026 02:443,40616,252,1841,998,000999,0002,359,296
5Jan 17, 2026 02:443,45822,544,1872,029,0001,014,0002,535,424
6Jan 17, 2026 02:443,84519,381,4422,256,0001,128,0002,351,104