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 6, 2026 08:48Victor MerckléVictor MerckléScore: 7,856Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 08:517,73714,218,2176,809,00002,113,536
2Jun 6, 2026 08:517,76214,263,3996,831,00002,113,536
3Jun 6, 2026 08:517,77214,271,5076,840,00002,113,536
4Jun 6, 2026 08:517,77614,233,4256,843,00002,113,536
5Jun 6, 2026 08:517,85614,281,0886,914,00002,113,536
6Jun 6, 2026 08:517,85714,229,2326,915,00002,113,536
7Jun 6, 2026 08:517,88014,311,6566,935,00002,113,536
8Jun 6, 2026 08:517,97614,395,9687,019,00002,113,536
9Jun 6, 2026 08:518,01214,424,1277,051,00002,113,536