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 07:418QTK8QTKScore: 3,398,213Success
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 07:413,392,5563,012,516,8962,984,450,000999,0002,277,376
2Jan 23, 2025 07:413,398,2133,020,028,7582,988,429,0001,998,0002,277,376
3Jan 23, 2025 07:413,421,5673,040,552,3193,009,980,000999,0002,269,184