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 11:15Victor MerckléVictor MerckléScore: 5,479Success
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 11:185,37712,201,9914,732,00002,113,536
2Jun 23, 2026 11:185,38212,223,3544,737,00002,113,536
3Jun 23, 2026 11:185,47212,301,2034,816,00002,113,536
4Jun 23, 2026 11:185,47512,301,0864,818,00002,113,536
5Jun 23, 2026 11:185,47912,728,5584,822,00002,113,536
6Jun 23, 2026 11:185,48012,260,9424,823,00002,113,536
7Jun 23, 2026 11:185,48112,591,0214,824,00002,113,536
8Jun 23, 2026 11:185,58512,447,4224,915,00002,113,536
9Jun 23, 2026 11:185,80112,595,1495,105,00002,113,536