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 09:118QTK8QTKScore: 121,164Success
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 09:11120,649130,211,513104,168,0002,003,0002,523,136
2Jan 23, 2025 09:11120,914129,151,747105,401,0001,003,0002,285,568
3Jan 23, 2025 09:11121,060127,591,371106,533,00002,285,568
4Jan 23, 2025 09:11121,061134,904,904105,529,0001,005,0002,285,568
5Jan 23, 2025 09:11121,164130,154,658105,619,0001,005,0002,269,184
6Jan 23, 2025 09:11121,201133,542,594105,651,0001,006,0002,277,376
7Jan 23, 2025 09:11121,316135,285,989104,744,0002,014,0002,285,568
8Jan 23, 2025 09:11121,489129,454,311104,912,0001,998,0002,269,184
9Jan 23, 2025 09:11121,685129,867,597103,080,0004,003,0002,375,680