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 12, 2026 14:23highload-churnerhighload-churnerScore: 3,161Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 14:263,07011,447,5982,702,00002,113,536
2Oct 12, 2026 14:263,07111,424,5292,703,00002,113,536
3Oct 12, 2026 14:263,08511,413,0692,715,00002,113,536
4Oct 12, 2026 14:263,08711,480,1392,717,00002,113,536
5Oct 12, 2026 14:263,16111,446,8832,782,00002,113,536
6Oct 12, 2026 14:263,16513,032,2542,786,00002,113,536
7Oct 12, 2026 14:263,17211,483,9082,792,00002,113,536
8Oct 12, 2026 14:263,18411,526,9312,802,00002,113,536
9Oct 12, 2026 14:263,18911,432,0342,807,00002,113,536