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:44zielajzielajError
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,494,6371,197,00002,113,536expected "6442459076 ", got "2305422578 "
2May 17, 2026 06:5508,380,3511,108,00002,113,536expected "6442459076 ", got "2305422578 "
3May 17, 2026 06:55011,387,8801,118,00002,113,536expected "6442459076 ", got "2305422578 "
4Jan 23, 2026 04:443,39218,230,8061,990,000995,0002,359,296
5Jan 23, 2026 04:443,46015,645,2991,015,0002,030,0002,359,296
6Jan 23, 2026 04:443,58017,419,0321,050,0002,100,0002,359,296