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 listJun 29, 2026 15:51Victor MerckléVictor MerckléScore: 4,831Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 15:544,71911,899,3894,153,00002,113,536
2Jun 29, 2026 15:544,72311,902,8154,157,00002,113,536
3Jun 29, 2026 15:544,82711,907,1594,248,00002,113,536
4Jun 29, 2026 15:544,82812,213,8224,249,00002,113,536
5Jun 29, 2026 15:544,83112,050,9274,252,00002,113,536
6Jun 29, 2026 15:544,83611,980,0314,256,00002,113,536
7Jun 29, 2026 15:544,84011,997,3344,260,00002,113,536
8Jun 29, 2026 15:544,85111,942,3284,269,00002,113,536
9Jun 29, 2026 15:545,11712,199,9874,503,00002,113,536