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:04highload-churnerhighload-churnerScore: 3,700Success
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:073,60911,875,4533,176,00002,113,536
2Oct 12, 2026 15:073,60911,859,7243,176,00002,113,536
3Oct 12, 2026 15:073,62011,831,6393,186,00002,113,536
4Oct 12, 2026 15:073,64811,827,2013,211,00002,113,536
5Oct 12, 2026 15:073,70011,920,1923,256,00002,113,536
6Oct 12, 2026 15:073,71812,029,3343,272,00002,113,536
7Oct 12, 2026 15:073,72111,925,1943,275,00002,113,536
8Oct 12, 2026 15:073,74011,911,6843,292,00002,113,536
9Oct 12, 2026 15:073,74412,117,2003,295,00002,113,536