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 16, 2026 01:12zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 06:51M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 06:5208,749,9081,114,00002,113,536expected "6442459076 ", got "2305422578 "
2May 17, 2026 06:5209,911,6731,116,00002,113,536expected "6442459076 ", got "2305422578 "
3May 17, 2026 06:5209,769,2821,158,00002,113,536expected "6442459076 ", got "2305422578 "
4Jan 16, 2026 01:103,38918,533,0201,988,000994,0002,535,424
5Jan 16, 2026 01:123,41922,370,8092,006,0001,003,0002,359,296
6Jan 16, 2026 01:103,44320,123,5521,010,0002,020,0002,359,296
7Jan 16, 2026 01:123,45523,547,7222,027,0001,013,0002,277,376
8Jan 16, 2026 01:123,46417,839,6932,032,0001,016,0002,277,376
9Jan 16, 2026 01:103,54522,902,9401,040,0002,080,0002,367,488