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:50highload-churnerhighload-churnerScore: 2,631Success
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:522,60410,938,6712,292,00002,113,536
2Oct 13, 2026 03:522,60511,098,7162,293,00002,113,536
3Oct 13, 2026 03:522,61110,921,6612,298,00002,113,536
4Oct 13, 2026 03:522,61211,009,7252,299,00002,113,536
5Oct 13, 2026 03:522,63111,030,6162,316,00002,113,536
6Oct 13, 2026 03:522,63211,040,3102,317,00002,113,536
7Oct 13, 2026 03:522,63610,955,7252,320,00002,113,536
8Oct 13, 2026 03:522,73411,079,3122,406,00002,113,536
9Oct 13, 2026 03:522,74511,091,3042,416,00002,113,536