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 19, 2026 19:44Victor MerckléVictor MerckléScore: 6,934Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 19:466,85314,199,0956,031,00002,113,536
2Jun 19, 2026 19:466,86713,511,1346,043,00002,113,536
3Jun 19, 2026 19:466,87913,565,9986,054,00002,113,536
4Jun 19, 2026 19:466,90213,501,4656,074,00002,113,536
5Jun 19, 2026 19:466,93413,611,6546,102,00002,113,536
6Jun 19, 2026 19:466,94313,553,7806,110,00002,113,536
7Jun 19, 2026 19:467,02913,647,0246,186,00002,113,536
8Jun 19, 2026 19:467,03413,925,9806,190,00002,113,536
9Jun 19, 2026 19:467,15713,568,2656,299,00002,113,536