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 8, 2026 00:42Victor MerckléVictor MerckléScore: 7,807Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 00:457,79514,186,0306,860,00002,113,536
2Jun 8, 2026 00:457,79714,170,4706,862,00002,113,536
3Jun 8, 2026 00:457,79814,208,9356,863,00002,113,536
4Jun 8, 2026 00:457,80514,202,7046,869,00002,113,536
5Jun 8, 2026 00:457,80714,317,9956,871,00002,113,536
6Jun 8, 2026 00:457,80714,513,7786,871,00002,113,536
7Jun 8, 2026 00:457,90614,226,9556,958,00002,113,536
8Jun 8, 2026 00:457,92816,033,8816,977,00002,113,536
9Jun 8, 2026 00:457,98014,323,3287,023,00002,113,536