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 8, 2026 00:03Victor MerckléVictor MerckléScore: 7,845Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 00:077,75114,131,6246,821,00002,113,536
2Jun 8, 2026 00:077,76214,141,7806,831,00002,113,536
3Jun 8, 2026 00:077,77214,152,7216,840,00002,113,536
4Jun 8, 2026 00:077,84214,159,1506,901,00002,113,536
5Jun 8, 2026 00:077,84514,346,3086,904,00002,113,536
6Jun 8, 2026 00:077,85314,161,0366,911,00002,113,536
7Jun 8, 2026 00:077,88014,202,5766,935,00002,113,536
8Jun 8, 2026 00:077,89514,735,7246,948,00002,113,536
9Jun 8, 2026 00:078,05414,429,0597,088,00002,113,536