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:12highload-churnerhighload-churnerScore: 2,653Success
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:152,63511,135,7532,319,00002,113,536
2Oct 13, 2026 03:152,64511,034,3732,328,00002,113,536
3Oct 13, 2026 03:152,64611,017,1092,329,00002,113,536
4Oct 13, 2026 03:152,64611,169,1722,329,00002,113,536
5Oct 13, 2026 03:152,65311,055,4582,335,00002,113,536
6Oct 13, 2026 03:152,73511,110,9482,407,00002,113,536
7Oct 13, 2026 03:152,75311,764,6632,423,00002,113,536
8Oct 13, 2026 03:152,75311,075,6972,423,00002,113,536
9Oct 13, 2026 03:152,75411,187,1382,424,00002,113,536