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 8, 2026 03:22zielajzielajScore: 3,457Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2026 03:223,32418,893,0981,950,000975,0002,375,680
2Feb 8, 2026 03:223,33919,420,2341,959,000979,0002,375,680
3Feb 8, 2026 03:223,34124,437,4161,960,000980,0002,375,680
4Feb 8, 2026 03:223,43417,094,1272,015,0001,007,0002,375,680
5Feb 8, 2026 03:223,45721,090,9832,028,0001,014,0002,371,584
6Feb 8, 2026 03:223,46820,393,0572,035,0001,017,0002,375,680
7Feb 8, 2026 03:223,49818,939,8151,026,0002,052,0002,375,680
8Feb 8, 2026 03:223,49918,603,6492,053,0001,026,0002,371,584
9Feb 8, 2026 03:224,14022,890,6153,643,00002,367,488