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 listOct 9, 2026 22:25highload-churnerhighload-churnerScore: 6,220Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 23:456,16115,733,8935,422,000028,672
2Oct 9, 2026 23:456,16215,731,3525,423,000028,672
3Oct 9, 2026 23:456,17015,849,7175,430,000028,672
4Oct 9, 2026 23:456,18615,781,5945,444,000028,672
5Oct 9, 2026 23:456,22015,763,8705,474,000028,672
6Oct 9, 2026 23:456,22215,997,7415,476,000028,672
7Oct 9, 2026 23:456,22715,894,9885,480,000028,672
8Oct 9, 2026 23:456,22716,479,7585,480,000028,672
9Oct 9, 2026 23:456,44027,475,3954,466,0001,202,00028,672