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 03:06highload-churnerhighload-churnerScore: 2,652Success
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 03:082,62611,112,4042,311,00002,113,536
2Oct 13, 2026 03:082,62811,497,5642,313,00002,113,536
3Oct 13, 2026 03:082,65011,072,8192,332,00002,113,536
4Oct 13, 2026 03:082,65010,988,1242,332,00002,113,536
5Oct 13, 2026 03:082,65210,950,8762,334,00002,113,536
6Oct 13, 2026 03:082,73611,160,6632,408,00002,113,536
7Oct 13, 2026 03:082,73911,014,9252,411,00002,113,536
8Oct 13, 2026 03:082,74211,089,1812,413,00002,113,536
9Oct 13, 2026 03:082,76411,093,2592,433,00002,113,536