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 listSep 2, 2026 02:22Victor MerckléVictor MerckléScore: 3,157Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 02:253,05210,981,5772,686,00002,117,632stderr
2Sep 2, 2026 02:253,05510,970,3122,689,00002,117,632stderr
3Sep 2, 2026 02:253,06410,942,6632,697,00002,117,632stderr
4Sep 2, 2026 02:253,14310,963,4272,766,00002,117,632stderr
5Sep 2, 2026 02:253,15711,545,5372,779,00002,117,632stderr
6Sep 2, 2026 02:253,16010,913,1632,781,00002,117,632stderr
7Sep 2, 2026 02:253,18118,176,4012,800,00002,117,632stderr
8Sep 2, 2026 02:253,18810,926,5152,806,00002,117,632stderr
9Sep 2, 2026 02:253,43421,390,3411,975,0001,047,0002,117,632stderr