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:39highload-churnerhighload-churnerScore: 14,242Success
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:5114,15722,677,01012,459,000020,480
2Oct 9, 2026 14:5114,16924,041,04512,469,000020,480
3Oct 9, 2026 14:5114,18222,697,21412,481,000020,480
4Oct 9, 2026 14:5114,18622,757,14212,484,000020,480
5Oct 9, 2026 14:5114,24222,724,30512,533,000020,480
6Oct 9, 2026 14:5114,32129,739,54512,603,000020,480
7Oct 9, 2026 14:5114,34322,827,82512,622,000020,480
8Oct 9, 2026 14:5114,34430,272,54112,623,000020,480
9Oct 9, 2026 14:5114,41330,481,60012,684,000020,480