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 6, 2026 22:23vahookvahookScore: 3,458Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2026 22:233,38516,561,128993,0001,986,0002,498,560
2Feb 6, 2026 22:233,43824,669,8811,008,0002,017,0002,502,656
3Feb 6, 2026 22:233,44115,905,6221,009,0002,019,0002,482,176
4Feb 6, 2026 22:233,45822,528,3301,014,0002,029,0002,494,464
5Feb 6, 2026 22:233,51618,308,0371,031,0002,063,0002,490,368
6Feb 6, 2026 22:233,60319,080,2781,057,0002,114,0002,281,472