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 04:11highload-churnerhighload-churnerScore: 2,605Success
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 04:142,59410,957,3262,283,00002,113,536
2Oct 13, 2026 04:142,59610,930,0492,285,00002,113,536
3Oct 13, 2026 04:142,60112,635,0852,289,00002,113,536
4Oct 13, 2026 04:142,60211,033,5552,290,00002,113,536
5Oct 13, 2026 04:142,60511,078,7762,293,00002,113,536
6Oct 13, 2026 04:142,61011,022,1282,297,00002,113,536
7Oct 13, 2026 04:142,62011,093,6582,306,00002,113,536
8Oct 13, 2026 04:142,64311,002,8882,326,00002,113,536
9Oct 13, 2026 04:142,88211,280,5742,537,00002,113,536