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 listAug 29, 2026 16:59Victor MerckléVictor MerckléScore: 3,073Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 17:043,04010,853,5832,676,00002,117,632stderr
2Aug 29, 2026 17:043,04510,891,4312,680,00002,117,632stderr
3Aug 29, 2026 17:043,04810,905,4012,683,00002,117,632stderr
4Aug 29, 2026 17:043,06910,929,0052,701,00002,117,632stderr
5Aug 29, 2026 17:043,07311,101,8632,705,00002,117,632stderr
6Aug 29, 2026 17:043,15216,320,2522,774,00002,117,632stderr
7Aug 29, 2026 17:043,16310,953,2442,784,00002,117,632stderr
8Aug 29, 2026 17:043,18110,962,1732,800,00002,117,632stderr
9Aug 29, 2026 17:043,28119,985,2602,888,00002,117,632stderr