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 listFeb 6, 2026 05:15vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 07:10M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 07:1008,456,2791,275,00002,113,536expected "6442459076 ", got " "
2May 17, 2026 07:1008,372,9131,261,00002,113,536expected "6442459076 ", got " "
3May 17, 2026 07:10010,271,8601,277,00002,113,536expected "6442459076 ", got " "
4Feb 6, 2026 05:163,41018,390,5481,000,0002,001,0002,494,464
5Feb 6, 2026 05:153,42718,011,9141,005,0002,011,0002,498,560
6Feb 6, 2026 05:163,47520,479,4481,019,0002,039,0002,281,472
7Feb 6, 2026 05:163,48818,716,0011,023,0002,046,0002,490,368
8Feb 6, 2026 05:153,49520,634,2731,025,0002,051,0002,498,560
9Feb 6, 2026 05:153,50822,003,6561,029,0002,058,0002,277,376