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 26, 2026 01:38zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 06:55M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 06:5508,312,3231,173,00002,113,536expected "6442459076 ", got "2305422578 "
2May 17, 2026 06:5508,679,6191,196,00002,113,536expected "6442459076 ", got "2305422578 "
3May 17, 2026 06:5509,310,8781,173,00002,113,536expected "6442459076 ", got "2305422578 "
4Jan 26, 2026 01:383,43019,357,4131,006,0002,012,0002,277,376
5Jan 26, 2026 01:383,46119,836,7062,031,0001,015,0002,351,104
6Jan 26, 2026 01:384,30316,945,8013,787,00002,363,392