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 20, 2025 18:46matsuoka-601matsuoka-601Score: 8,992Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 20, 2025 18:468,82522,638,6596,657,0001,109,0002,424,832
2Jan 20, 2025 18:468,83333,651,9015,552,0002,221,0002,281,472
3Jan 20, 2025 18:468,98623,850,4316,920,000988,0002,428,928
4Jan 20, 2025 18:468,99126,075,0495,934,0001,978,0002,531,328
5Jan 20, 2025 18:468,99221,314,6865,935,0001,978,0002,531,328
6Jan 20, 2025 18:468,99325,362,7365,936,0001,978,0002,412,544
7Jan 20, 2025 18:468,99324,800,2596,925,000989,0002,428,928
8Jan 20, 2025 18:468,99330,153,1775,936,0001,978,0002,531,328
9Jan 20, 2025 18:468,99723,449,1896,928,000989,0002,531,328