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 listSep 3, 2026 00:46Victor MerckléVictor MerckléScore: 2,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 00:492,62610,500,0932,311,000024,576stderr
2Sep 3, 2026 00:492,64811,101,2102,331,000024,576stderr
3Sep 3, 2026 00:492,65110,482,2672,333,000024,576stderr
4Sep 3, 2026 00:492,65310,530,1012,335,000024,576stderr
5Sep 3, 2026 00:492,65911,145,5582,340,000024,576stderr
6Sep 3, 2026 00:492,66210,489,7592,343,000024,576stderr
7Sep 3, 2026 00:492,66910,831,7292,349,000024,576stderr
8Sep 3, 2026 00:492,68012,118,0982,359,000024,576stderr
9Sep 3, 2026 00:492,79012,629,5232,456,000024,576stderr