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 09:07Victor MerckléVictor MerckléScore: 5,822Success
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 09:105,69712,553,0175,014,00002,113,536
2Jun 23, 2026 09:105,79812,596,8825,103,00002,113,536
3Jun 23, 2026 09:105,80412,873,9745,108,00002,113,536
4Jun 23, 2026 09:105,81512,869,7895,118,00002,113,536
5Jun 23, 2026 09:105,82212,559,2775,124,00002,113,536
6Jun 23, 2026 09:105,83012,922,1195,131,00002,113,536
7Jun 23, 2026 09:105,83412,746,4485,134,00002,113,536
8Jun 23, 2026 09:105,83612,563,5295,136,00002,113,536
9Jun 23, 2026 09:105,84012,621,6595,140,00002,113,536