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 15, 2026 17:10Victor MerckléVictor MerckléScore: 7,861Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2026 17:187,77614,254,8066,843,00002,113,536
2Jun 15, 2026 17:187,83814,202,8776,898,00002,113,536
3Jun 15, 2026 17:187,85214,231,4816,910,00002,113,536
4Jun 15, 2026 17:187,85314,222,1436,911,00002,113,536
5Jun 15, 2026 17:187,86114,243,9466,918,00002,113,536
6Jun 15, 2026 17:187,88214,238,3326,937,00002,113,536
7Jun 15, 2026 17:187,91214,282,6646,963,00002,113,536
8Jun 15, 2026 17:187,93214,503,7676,981,00002,113,536
9Jun 15, 2026 17:188,64514,893,5737,608,00002,113,536