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 17:25highload-churnerhighload-churnerScore: 12,096Success
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 17:3511,77120,720,29410,359,000024,576
2Oct 9, 2026 17:3511,99328,548,8709,501,0001,053,00020,480
3Oct 9, 2026 17:3512,05328,587,2299,572,0001,035,00020,480
4Oct 9, 2026 17:3512,07229,956,6219,583,0001,041,00028,672
5Oct 9, 2026 17:3512,09630,477,7859,592,0001,053,00020,480
6Oct 9, 2026 17:3512,14630,478,3119,592,0001,097,00020,480
7Oct 9, 2026 17:3512,14830,508,8819,624,0001,067,00020,480
8Oct 9, 2026 17:3512,15329,955,5289,618,0001,077,00020,480
9Oct 9, 2026 17:3512,33626,084,6109,703,0001,153,00028,672