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 8, 2025 16:04Alex KentAlex KentScore: 890,281Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2025 16:04888,544802,483,822779,920,0001,999,0002,273,280
2Jan 8, 2025 16:04888,876804,499,649782,211,00002,289,664
3Jan 8, 2025 16:04890,085807,975,715782,275,0001,000,0002,273,280
4Jan 8, 2025 16:04890,251810,377,127781,423,0001,998,0002,281,472
5Jan 8, 2025 16:04890,281809,467,209782,447,0001,000,0002,289,664
6Jan 8, 2025 16:04890,375807,840,227782,531,000999,0002,289,664
7Jan 8, 2025 16:04890,451807,666,653781,599,0001,998,0002,289,664
8Jan 8, 2025 16:04891,167805,144,013783,227,0001,000,0002,265,088
9Jan 8, 2025 16:04892,402810,355,587783,316,0001,998,0002,269,184