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 14:52Josu San MartinJosu San MartinScore: 51,625Success
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 14:5251,29575,389,96944,137,0001,003,0002,449,408
2Jan 17, 2026 14:5251,47667,710,72844,293,0001,006,0002,445,312
3Jan 17, 2026 14:5251,50870,550,27645,327,00002,453,504
4Jan 17, 2026 14:5251,53666,176,43244,345,0001,007,0002,453,504
5Jan 17, 2026 14:5251,62575,692,14445,430,00002,293,760
6Jan 17, 2026 14:5251,63870,966,86444,432,0001,009,0002,449,408
7Jan 17, 2026 14:5251,67768,449,83544,466,0001,010,0002,453,504
8Jan 17, 2026 14:5251,68170,788,46745,479,00002,445,312
9Jan 17, 2026 14:5251,88972,708,78244,648,0001,014,0002,281,472