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 14, 2025 03:15mgildermgilderScore: 248,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 14, 2025 03:15247,805240,355,447217,068,0001,000,0002,363,392
2Feb 14, 2025 03:15248,361245,069,223217,556,0001,002,0002,289,664
3Feb 14, 2025 03:15248,381245,581,615217,573,0001,002,0002,363,392
4Feb 14, 2025 03:15248,705245,049,195216,862,0001,998,0002,289,664
5Feb 14, 2025 03:15248,857241,217,813217,995,000999,0002,367,488
6Feb 14, 2025 03:15249,198245,026,075219,294,00002,289,664
7Feb 14, 2025 03:15249,427247,070,699218,494,0001,002,0002,367,488
8Feb 14, 2025 03:15249,486245,269,764218,546,0001,002,0002,289,664
9Feb 14, 2025 03:15250,503247,472,223219,441,0001,002,0002,289,664