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 listMay 19, 2025 05:14KeefeKeefeScore: 65,136Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2025 05:1464,90778,979,91555,114,0002,004,0002,273,280
2May 19, 2025 05:1465,04978,256,30456,239,0001,004,0002,392,064
3May 19, 2025 05:1465,05083,483,65456,240,0001,004,0002,383,872
4May 19, 2025 05:1465,10680,149,71857,293,00002,383,872
5May 19, 2025 05:1465,13689,360,25556,315,0001,005,0002,273,280
6May 19, 2025 05:1465,14383,561,54555,315,0002,011,0002,273,280
7May 19, 2025 05:1465,16979,914,28256,343,0001,006,0002,379,776
8May 19, 2025 05:1465,21485,482,21556,382,0001,006,0002,387,968
9May 19, 2025 05:1465,43379,604,53057,581,00002,273,280