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 19, 2026 21:59Victor MerckléVictor MerckléScore: 7,006Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 22:026,88613,528,0986,060,00002,113,536
2Jun 19, 2026 22:026,91513,602,6286,086,00002,113,536
3Jun 19, 2026 22:026,92213,754,2006,092,00002,113,536
4Jun 19, 2026 22:026,98213,628,8016,145,00002,113,536
5Jun 19, 2026 22:027,00613,625,4856,166,00002,113,536
6Jun 19, 2026 22:027,00913,848,4896,168,00002,113,536
7Jun 19, 2026 22:027,02513,631,3596,182,00002,113,536
8Jun 19, 2026 22:027,06713,899,7316,219,00002,113,536
9Jun 19, 2026 22:027,13014,017,5746,275,00002,113,536