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 22, 2025 11:47KeefeKeefeScore: 121,395Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2025 11:47120,930135,640,247105,415,0001,003,0002,408,448
2Feb 22, 2025 11:47120,932135,174,924106,420,00002,277,376
3Feb 22, 2025 11:47121,024132,737,114105,497,0001,004,0002,277,376
4Feb 22, 2025 11:47121,266133,587,397106,714,00002,400,256
5Feb 22, 2025 11:47121,395137,123,430103,833,0002,995,0002,277,376
6Feb 22, 2025 11:47121,398133,704,842104,834,0001,996,0002,396,160
7Feb 22, 2025 11:47121,514133,318,875105,933,000999,0002,404,352
8Feb 22, 2025 11:47121,545130,094,210104,961,0001,999,0002,404,352
9Feb 22, 2025 11:47121,580130,503,371104,991,0001,999,0002,277,376