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 17:48Victor MerckléVictor MerckléScore: 5,234Success
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 17:505,11012,058,3364,497,00002,113,536
2Jun 23, 2026 17:505,11112,052,6104,498,00002,113,536
3Jun 23, 2026 17:505,13912,400,1464,523,00002,113,536
4Jun 23, 2026 17:505,23012,084,1404,603,00002,113,536
5Jun 23, 2026 17:505,23412,056,0544,606,00002,113,536
6Jun 23, 2026 17:505,23812,452,8144,610,00002,113,536
7Jun 23, 2026 17:505,25112,441,5524,621,00002,113,536
8Jun 23, 2026 17:505,33912,182,6394,699,00002,113,536
9Jun 23, 2026 17:505,63912,407,7634,963,00002,113,536