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 17:02Yuriy LyfenkoYuriy LyfenkoScore: 19,341Success
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 17:0219,19140,793,37116,888,00002,510,848
2Mar 20, 2026 17:0219,21945,055,84715,919,000994,0002,289,664
3Mar 20, 2026 17:0219,22539,454,64914,928,0001,990,0002,510,848
4Mar 20, 2026 17:0219,33942,306,71515,016,0002,002,0002,510,848
5Mar 20, 2026 17:0219,34143,791,13915,018,0002,002,0002,510,848
6Mar 20, 2026 17:0219,34444,536,25615,021,0002,002,0002,289,664
7Mar 20, 2026 17:0219,38340,486,41715,051,0002,006,0002,289,664
8Mar 20, 2026 17:0219,41648,054,82715,076,0002,010,0002,519,040
9Mar 20, 2026 17:0223,74246,311,94218,904,0001,989,0002,347,008