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 23, 2026 05:48Victor MerckléVictor MerckléScore: 6,055Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 05:505,89312,715,8895,186,00002,113,536
2Jun 23, 2026 05:505,90212,687,9105,194,00002,113,536
3Jun 23, 2026 05:506,01112,702,1955,290,00002,113,536
4Jun 23, 2026 05:506,01913,142,1715,297,00002,113,536
5Jun 23, 2026 05:506,05513,086,5465,329,00002,113,536
6Jun 23, 2026 05:506,06813,099,9825,340,00002,113,536
7Jun 23, 2026 05:506,07113,156,6265,343,00002,113,536
8Jun 23, 2026 05:506,15113,265,0015,413,00002,113,536
9Jun 23, 2026 05:506,31513,027,0775,558,00002,113,536