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 00:50Victor MerckléVictor MerckléScore: 8,021Success
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 00:527,92514,419,7526,974,00002,113,536
2Jun 7, 2026 00:527,98614,375,2867,028,00002,113,536
3Jun 7, 2026 00:528,00414,453,5037,044,00002,113,536
4Jun 7, 2026 00:528,00914,712,1547,048,00002,113,536
5Jun 7, 2026 00:528,02114,633,0877,059,00002,113,536
6Jun 7, 2026 00:528,02814,479,9737,065,00002,113,536
7Jun 7, 2026 00:528,03814,410,2107,074,00002,113,536
8Jun 7, 2026 00:528,15614,597,3187,178,00002,113,536
9Jun 7, 2026 00:528,36714,740,4857,363,00002,113,536