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:56Victor MerckléVictor MerckléScore: 17,172Success
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:5716,91531,482,89512,902,0001,984,0002,387,968
2Apr 23, 2026 05:5717,13033,442,16313,065,0002,010,0002,383,872
3Apr 23, 2026 05:5717,16233,940,38213,090,0002,013,0002,383,872
4Apr 23, 2026 05:5717,16830,131,43614,101,0001,007,0002,379,776
5Apr 23, 2026 05:5717,17236,338,08413,097,0002,015,0002,383,872
6Apr 23, 2026 05:5717,18732,828,53214,117,0001,008,0002,379,776
7Apr 23, 2026 05:5717,19828,731,44013,117,0002,018,0002,383,872
8Apr 23, 2026 05:5717,20535,251,23514,132,0001,009,0002,379,776
9Apr 23, 2026 05:5717,31932,303,18914,225,0001,016,0002,383,872