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 17:06highload-churnerhighload-churnerScore: 2,704Success
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 17:092,68911,156,8172,367,00002,113,536
2Oct 12, 2026 17:092,69411,148,6312,371,00002,113,536
3Oct 12, 2026 17:092,70011,255,3062,376,00002,113,536
4Oct 12, 2026 17:092,70011,199,6882,376,00002,113,536
5Oct 12, 2026 17:092,70411,030,5772,380,00002,113,536
6Oct 12, 2026 17:092,70511,219,5112,381,00002,113,536
7Oct 12, 2026 17:092,70611,065,4772,382,00002,113,536
8Oct 12, 2026 17:092,82311,136,6572,485,00002,113,536
9Oct 12, 2026 17:092,93011,349,8372,579,00002,113,536