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 listMar 19, 2026 15:43Ondřej PolaneckýOndřej PolaneckýScore: 60,361Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 15:4360,10578,987,85048,901,0003,991,0002,355,200
2Mar 19, 2026 15:4360,26877,319,17152,036,0001,000,0002,289,664
3Mar 19, 2026 15:4360,27278,585,44650,037,0003,002,0002,289,664
4Mar 19, 2026 15:4360,32376,072,94652,083,0001,001,0002,281,472
5Mar 19, 2026 15:4360,36174,544,65449,110,0004,008,0002,289,664
6Mar 19, 2026 15:4360,42074,638,49252,167,0001,003,0002,514,944
7Mar 19, 2026 15:4360,44474,678,95251,184,0002,007,0002,285,568
8Mar 19, 2026 15:4360,45976,040,59051,197,0002,007,0002,519,040
9Mar 19, 2026 15:4360,66073,388,55448,439,0004,942,0002,281,472