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:10highload-churnerhighload-churnerScore: 2,636Success
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:122,61511,076,2472,302,00002,113,536
2Oct 13, 2026 03:122,62311,072,3062,309,00002,113,536
3Oct 13, 2026 03:122,62711,175,3742,312,00002,113,536
4Oct 13, 2026 03:122,63111,228,6742,316,00002,113,536
5Oct 13, 2026 03:122,63611,048,7802,320,00002,113,536
6Oct 13, 2026 03:122,64211,099,0352,325,00002,113,536
7Oct 13, 2026 03:122,64411,144,2952,327,00002,113,536
8Oct 13, 2026 03:122,66911,112,2752,349,00002,113,536
9Oct 13, 2026 03:122,80613,172,2722,470,00002,113,536