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:34highload-churnerhighload-churnerScore: 2,647Success
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:372,62510,967,6582,310,00002,113,536
2Oct 13, 2026 03:372,63111,040,8952,316,00002,113,536
3Oct 13, 2026 03:372,64311,160,2962,326,00002,113,536
4Oct 13, 2026 03:372,64411,031,5672,327,00002,113,536
5Oct 13, 2026 03:372,64711,086,6152,330,00002,113,536
6Oct 13, 2026 03:372,64711,093,1042,330,00002,113,536
7Oct 13, 2026 03:372,65411,047,9122,336,00002,113,536
8Oct 13, 2026 03:372,65411,127,1272,336,00002,113,536
9Oct 13, 2026 03:372,74011,043,2832,412,00002,113,536