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 23, 2026 01:53Victor MerckléVictor MerckléScore: 7,648Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 01:577,59414,253,6796,683,00002,113,536
2Jun 23, 2026 01:577,59614,129,2426,685,00002,113,536
3Jun 23, 2026 01:577,63114,338,0936,716,00002,113,536
4Jun 23, 2026 01:577,64414,484,9006,727,00002,113,536
5Jun 23, 2026 01:577,64814,504,0166,731,00002,113,536
6Jun 23, 2026 01:577,67314,547,7866,753,00002,113,536
7Jun 23, 2026 01:577,68014,232,6916,759,00002,113,536
8Jun 23, 2026 01:577,69614,434,5276,773,00002,113,536
9Jun 23, 2026 01:577,84214,421,4726,901,00002,113,536