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 20:06Victor MerckléVictor MerckléScore: 11,744Success
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 20:0711,65426,873,7569,231,0001,025,0002,387,968
2Apr 23, 2026 20:0711,71128,842,1399,276,0001,030,0002,375,680
3Apr 23, 2026 20:0711,72823,989,5099,289,0001,032,0002,375,680
4Apr 23, 2026 20:0711,74231,276,3689,300,0001,033,0002,392,064
5Apr 23, 2026 20:0711,74427,265,8569,302,0001,033,0002,379,776
6Apr 23, 2026 20:0711,75428,368,6569,310,0001,034,0002,383,872
7Apr 23, 2026 20:0711,77728,838,9319,328,0001,036,0002,387,968
8Apr 23, 2026 20:0711,82625,902,5749,367,0001,040,0002,461,696
9Apr 23, 2026 20:0711,87924,042,4999,409,0001,045,0002,387,968