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 17, 2026 05:38Josu San MartinJosu San MartinScore: 40,936Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2026 05:3840,78465,281,74633,897,0001,993,0002,445,312
2Jan 17, 2026 05:3840,80065,606,22233,910,0001,994,0002,441,216
3Jan 17, 2026 05:3840,82458,830,57933,930,0001,995,0002,445,312
4Jan 17, 2026 05:3840,92562,223,71735,014,0001,000,0002,445,312
5Jan 17, 2026 05:3840,93655,946,42034,023,0002,001,0002,281,472
6Jan 17, 2026 05:3841,02861,401,44734,100,0002,005,0002,433,024
7Jan 17, 2026 05:3841,03560,834,44234,105,0002,006,0002,281,472
8Jan 17, 2026 05:3841,04861,026,05435,119,0001,003,0002,433,024
9Jan 17, 2026 05:3841,34458,582,98435,373,0001,010,0002,441,216