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 listApr 23, 2026 05:09Victor MerckléVictor MerckléScore: 16,987Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 05:1016,91031,510,01012,897,0001,984,0002,318,336
2Apr 23, 2026 05:1016,91230,056,64912,899,0001,984,0002,387,968
3Apr 23, 2026 05:1016,94530,379,65912,924,0001,988,0002,375,680
4Apr 23, 2026 05:1016,95433,289,46112,931,0001,989,0002,379,776
5Apr 23, 2026 05:1016,98731,615,29212,956,0001,993,0002,318,336
6Apr 23, 2026 05:1016,98833,869,65312,957,0001,993,0002,375,680
7Apr 23, 2026 05:1016,99430,585,58712,961,0001,994,0002,383,872
8Apr 23, 2026 05:1017,03732,715,46612,994,0001,999,0002,379,776
9Apr 23, 2026 05:1017,09236,764,23114,039,0001,002,0002,387,968