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 13:42highload-churnerhighload-churnerScore: 17,882Success
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 13:5217,83425,950,10015,694,000020,480
2Oct 9, 2026 13:5217,85425,888,56415,712,000020,480
3Oct 9, 2026 13:5217,86425,913,81715,721,000020,480
4Oct 9, 2026 13:5217,87125,902,23915,727,000020,480
5Oct 9, 2026 13:5217,88226,059,76015,737,000020,480
6Oct 9, 2026 13:5217,88625,977,28215,740,000020,480
7Oct 9, 2026 13:5217,88725,988,28915,741,000020,480
8Oct 9, 2026 13:5217,88925,923,95415,743,000020,480
9Oct 9, 2026 13:5217,92325,885,71315,773,000020,480