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 14:03highload-churnerhighload-churnerScore: 15,759Success
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 14:0715,73823,994,31113,850,000020,480
2Oct 9, 2026 14:0715,74224,115,24313,853,000020,480
3Oct 9, 2026 14:0715,75624,055,96813,866,000020,480
4Oct 9, 2026 14:0715,75724,091,32213,867,000020,480
5Oct 9, 2026 14:0715,75924,146,02913,868,000020,480
6Oct 9, 2026 14:0715,77524,209,34113,882,000020,480
7Oct 9, 2026 14:0715,77524,031,15113,882,000020,480
8Oct 9, 2026 14:0715,78024,152,52313,887,000020,480
9Oct 9, 2026 14:0715,78624,066,84813,892,000020,480