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 listFeb 23, 2025 07:09KeefeKeefeScore: 114,132Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2025 07:09113,600128,652,21797,969,0001,999,0002,293,760
2Feb 23, 2025 07:09113,847126,306,91598,182,0002,003,0002,293,760
3Feb 23, 2025 07:09113,874128,181,93797,203,0003,006,0002,277,376
4Feb 23, 2025 07:09114,081126,202,12799,388,0001,003,0002,277,376
5Feb 23, 2025 07:09114,132133,742,09199,432,0001,004,0002,293,760
6Feb 23, 2025 07:09114,218126,623,47699,507,0001,005,0002,293,760
7Feb 23, 2025 07:09114,243122,605,23899,529,0001,005,0002,289,664
8Feb 23, 2025 07:09114,570130,073,73698,826,0001,996,0002,293,760
9Feb 23, 2025 07:09114,632126,655,75098,879,0001,997,0002,273,280