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 21, 2026 14:01Victor MerckléVictor MerckléScore: 6,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 14:036,78913,448,2845,975,00002,113,536
2Jun 21, 2026 14:036,81113,461,4315,994,00002,113,536
3Jun 21, 2026 14:036,86813,468,1686,044,00002,113,536
4Jun 21, 2026 14:036,87513,518,7816,050,00002,113,536
5Jun 21, 2026 14:036,88913,799,5826,063,00002,113,536
6Jun 21, 2026 14:036,92813,546,9586,097,00002,113,536
7Jun 21, 2026 14:036,97513,565,8516,138,00002,113,536
8Jun 21, 2026 14:037,09813,757,0396,247,00002,113,536
9Jun 21, 2026 14:037,22514,111,1276,358,00002,113,536