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 27, 2026 19:19Victor MerckléVictor MerckléScore: 5,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 19:215,17612,270,2214,555,00002,113,536
2Jun 27, 2026 19:215,18812,381,6284,566,00002,113,536
3Jun 27, 2026 19:215,26112,590,2164,630,00002,113,536
4Jun 27, 2026 19:215,26812,315,0384,636,00002,113,536
5Jun 27, 2026 19:215,27812,612,7084,645,00002,113,536
6Jun 27, 2026 19:215,29412,636,4984,659,00002,113,536
7Jun 27, 2026 19:215,33812,649,3564,698,00002,113,536
8Jun 27, 2026 19:215,34512,483,2384,704,00002,113,536
9Jun 27, 2026 19:215,48912,493,5644,831,00002,113,536