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 listFeb 23, 2025 02:57wainCGPwainCGPScore: 52,503Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2025 02:5752,32670,777,31241,042,0005,005,0002,506,752
2Feb 23, 2025 02:5752,38469,505,56541,088,0005,010,0002,490,368
3Feb 23, 2025 02:5752,44767,843,93141,137,0005,016,0002,289,664
4Feb 23, 2025 02:5752,44868,963,46441,138,0005,016,0002,314,240
5Feb 23, 2025 02:5752,50370,770,79242,186,0004,017,0002,510,848
6Feb 23, 2025 02:5752,52667,521,80841,199,0005,024,0002,502,656
7Feb 23, 2025 02:5752,58969,421,78542,254,0004,024,0002,473,984
8Feb 23, 2025 02:5752,68377,070,51440,314,0006,047,0002,510,848
9Feb 23, 2025 02:5752,78670,763,33842,413,0004,039,0002,392,064