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:15highload-churnerhighload-churnerScore: 2,656Success
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:182,63111,054,2702,316,00002,113,536
2Oct 13, 2026 03:182,64311,083,0962,326,00002,113,536
3Oct 13, 2026 03:182,65111,182,3752,333,00002,113,536
4Oct 13, 2026 03:182,65211,057,7172,334,00002,113,536
5Oct 13, 2026 03:182,65611,078,3512,338,00002,113,536
6Oct 13, 2026 03:182,65711,101,5572,339,00002,113,536
7Oct 13, 2026 03:182,66111,061,4582,342,00002,113,536
8Oct 13, 2026 03:182,66211,112,4692,343,00002,113,536
9Oct 13, 2026 03:182,67211,111,6482,352,00002,113,536