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 12, 2026 15:16highload-churnerhighload-churnerScore: 2,986Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 15:192,88711,255,2122,541,00002,113,536
2Oct 12, 2026 15:192,89711,329,1542,550,00002,113,536
3Oct 12, 2026 15:192,89711,278,2852,550,00002,113,536
4Oct 12, 2026 15:192,98211,242,5912,625,00002,113,536
5Oct 12, 2026 15:192,98611,360,8372,628,00002,113,536
6Oct 12, 2026 15:193,00511,375,0992,645,00002,113,536
7Oct 12, 2026 15:193,00711,336,7682,647,00002,113,536
8Oct 12, 2026 15:193,15711,471,5662,779,00002,113,536
9Oct 12, 2026 15:193,25611,737,3811,433,0001,433,0002,113,536