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 9, 2026 15:23highload-churnerhighload-churnerScore: 13,479Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 15:5913,46022,173,39011,845,000020,480
2Oct 9, 2026 15:5913,46022,223,81911,845,000020,480
3Oct 9, 2026 15:5913,46122,213,37311,846,000020,480
4Oct 9, 2026 15:5913,46522,914,06811,850,000020,480
5Oct 9, 2026 15:5913,47922,224,95811,862,000020,480
6Oct 9, 2026 15:5913,48822,209,66011,870,000020,480
7Oct 9, 2026 15:5913,54222,218,26911,917,000020,480
8Oct 9, 2026 15:5913,61922,294,40710,888,0001,097,00020,480
9Oct 9, 2026 15:5913,76523,115,96011,020,0001,094,00020,480