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 13, 2026 07:49highload-churnerhighload-churnerScore: 2,412Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 07:522,38510,793,3472,099,000020,480
2Oct 13, 2026 07:522,39210,793,0232,105,000020,480
3Oct 13, 2026 07:522,40010,877,1432,112,000020,480
4Oct 13, 2026 07:522,40510,822,0742,117,000020,480
5Oct 13, 2026 07:522,41210,807,3522,123,000020,480
6Oct 13, 2026 07:522,41510,778,1042,126,000020,480
7Oct 13, 2026 07:522,44010,845,8302,148,000020,480
8Oct 13, 2026 07:522,54410,953,2682,239,000020,480
9Oct 13, 2026 07:522,60211,052,3652,290,000020,480