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 listDec 24, 2025 19:27Yehor BondarYehor BondarScore: 571,988Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2025 19:27571,297526,137,910500,743,0001,998,0002,289,664
2Dec 24, 2025 19:27571,402531,480,827500,835,0001,999,0002,289,664
3Dec 24, 2025 19:27571,790524,983,105501,175,0002,000,0002,265,088
4Dec 24, 2025 19:27571,977536,609,462502,340,0001,000,0002,281,472
5Dec 24, 2025 19:27571,988525,679,981502,349,0001,000,0002,289,664
6Dec 24, 2025 19:27572,210534,412,337503,545,00002,281,472
7Dec 24, 2025 19:27572,230527,335,778502,563,000999,0002,289,664
8Dec 24, 2025 19:27572,684528,035,825502,963,000999,0002,281,472
9Dec 24, 2025 19:27572,770527,791,671502,038,0002,000,0002,519,040