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 7, 2026 01:47Victor MerckléVictor MerckléScore: 7,607Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 01:507,58014,129,6786,671,00002,113,536
2Jun 7, 2026 01:507,59514,176,9126,684,00002,113,536
3Jun 7, 2026 01:507,60013,980,6176,688,00002,113,536
4Jun 7, 2026 01:507,60514,484,5266,693,00002,113,536
5Jun 7, 2026 01:507,60714,473,1156,695,00002,113,536
6Jun 7, 2026 01:507,63514,548,7036,719,00002,113,536
7Jun 7, 2026 01:507,63514,499,5436,719,00002,113,536
8Jun 7, 2026 01:507,63814,146,7916,722,00002,113,536
9Jun 7, 2026 01:507,64514,571,8716,728,00002,113,536