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 listJul 4, 2026 08:20Victor MerckléVictor MerckléScore: 4,681Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 08:234,55511,792,0834,009,00002,117,632stderr
2Jul 4, 2026 08:234,55611,825,3994,010,00002,117,632stderr
3Jul 4, 2026 08:234,63511,933,3094,079,00002,117,632stderr
4Jul 4, 2026 08:234,66711,876,7174,107,00002,117,632stderr
5Jul 4, 2026 08:234,68112,207,2334,120,00002,117,632stderr
6Jul 4, 2026 08:234,68511,926,1664,123,00002,117,632stderr
7Jul 4, 2026 08:234,80712,261,5854,231,00002,117,632stderr
8Jul 4, 2026 08:234,82012,043,4564,242,00002,117,632stderr
9Jul 4, 2026 08:234,82311,992,3594,245,00002,117,632stderr