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 7, 2026 01:35Victor MerckléVictor MerckléScore: 7,631Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 01:387,50913,943,5286,608,00002,113,536
2Jun 7, 2026 01:387,52713,941,2856,624,00002,113,536
3Jun 7, 2026 01:387,56516,565,3106,658,00002,113,536
4Jun 7, 2026 01:387,63014,092,7966,715,00002,113,536
5Jun 7, 2026 01:387,63113,970,9256,716,00002,113,536
6Jun 7, 2026 01:387,64814,242,4776,731,00002,113,536
7Jun 7, 2026 01:387,65613,994,6216,738,00002,113,536
8Jun 7, 2026 01:387,71314,117,2576,788,00002,113,536
9Jun 7, 2026 01:387,76514,069,3046,834,00002,113,536