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

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 07:09M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 07:0909,303,6451,180,00002,113,536expected "6442459076 ", got "2305422578 "
2May 17, 2026 07:0909,051,6381,102,00002,113,536expected "6442459076 ", got "2305422578 "
3May 17, 2026 07:0909,310,1811,111,00002,113,536expected "6442459076 ", got "2305422578 "
4Jan 22, 2026 04:423,46119,344,5302,031,0001,015,0002,277,376
5Jan 22, 2026 04:423,48421,099,6952,044,0001,022,0002,392,064
6Jan 22, 2026 04:424,48517,344,2173,947,00002,387,968