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 10, 2026 00:25highload-churnerhighload-churnerScore: 6,245Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 01:556,21415,907,3395,469,000028,672
2Oct 10, 2026 01:556,22615,873,7335,479,000028,672
3Oct 10, 2026 01:556,22615,981,9935,479,000028,672
4Oct 10, 2026 01:556,23715,896,5745,489,000028,672
5Oct 10, 2026 01:556,24516,485,3195,496,000028,672
6Oct 10, 2026 01:556,24515,858,8315,496,000028,672
7Oct 10, 2026 01:556,33916,023,2915,579,000028,672
8Oct 10, 2026 01:556,35216,113,4695,590,000028,672
9Oct 10, 2026 01:557,07516,642,1856,226,000028,672