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 listJan 23, 2025 08:308QTK8QTKScore: 212,901Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 08:30212,572214,912,647185,063,0002,000,0002,269,184
2Jan 23, 2025 08:30212,577214,912,215186,068,0001,000,0002,265,088
3Jan 23, 2025 08:30212,676211,172,299186,155,0001,000,0002,289,664
4Jan 23, 2025 08:30212,773217,659,346186,239,0001,001,0002,285,568
5Jan 23, 2025 08:30212,901220,382,852185,350,0002,003,0002,523,136
6Jan 23, 2025 08:30212,945209,861,724187,392,00002,289,664
7Jan 23, 2025 08:30212,953209,014,787186,397,0001,002,0002,523,136
8Jan 23, 2025 08:30213,117209,501,138186,541,0001,002,0002,523,136
9Jan 23, 2025 08:30213,395213,762,606184,792,0002,996,0002,269,184