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:36Josu San MartinJosu San MartinScore: 41,668Success
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:3641,44857,162,15836,474,00002,281,472
2Jan 17, 2026 05:3641,54157,353,18335,541,0001,015,0002,449,408
3Jan 17, 2026 05:3641,62657,477,88236,631,00002,449,408
4Jan 17, 2026 05:3641,66663,986,70135,648,0001,018,0002,281,472
5Jan 17, 2026 05:3641,66864,884,73635,650,0001,018,0002,445,312
6Jan 17, 2026 05:3641,66963,382,22635,651,0001,018,0002,441,216
7Jan 17, 2026 05:3641,67368,357,79835,654,0001,018,0002,281,472
8Jan 17, 2026 05:3641,67559,993,45235,656,0001,018,0002,445,312
9Jan 17, 2026 05:3641,70062,821,49035,677,0001,019,0002,441,216