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 22:41Victor MerckléVictor MerckléScore: 6,954Success
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 22:436,84713,516,3556,026,00002,113,536
2Jun 19, 2026 22:436,88813,555,0046,062,00002,113,536
3Jun 19, 2026 22:436,90413,572,1836,076,00002,113,536
4Jun 19, 2026 22:436,91013,549,4616,081,00002,113,536
5Jun 19, 2026 22:436,95413,567,7846,120,00002,113,536
6Jun 19, 2026 22:436,99514,053,6856,156,00002,113,536
7Jun 19, 2026 22:437,00013,656,6836,160,00002,113,536
8Jun 19, 2026 22:437,00213,911,7906,162,00002,113,536
9Jun 19, 2026 22:437,10913,923,6216,256,00002,113,536