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 listMar 20, 2026 16:54Yuriy LyfenkoYuriy LyfenkoScore: 20,343Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 16:5420,20344,786,76717,779,00002,265,088
2Mar 20, 2026 16:5420,30244,051,38916,874,000992,0002,494,464
3Mar 20, 2026 16:5420,30645,147,72715,884,0001,985,0002,265,088
4Mar 20, 2026 16:5420,33335,666,65016,899,000994,0002,367,488
5Mar 20, 2026 16:5420,34343,413,34615,913,0001,989,0002,269,184
6Mar 20, 2026 16:5420,34735,011,87216,911,000994,0002,367,488
7Mar 20, 2026 16:5420,35247,231,85616,915,000995,0002,371,584
8Mar 20, 2026 16:5420,37534,758,38115,938,0001,992,0002,265,088
9Mar 20, 2026 16:5420,39142,381,55915,951,0001,993,0002,375,680