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 listApr 21, 2026 09:59Victor MerckléVictor MerckléScore: 49,837Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 10:0049,48468,686,46141,521,0002,025,0002,490,368
2Apr 21, 2026 10:0049,56069,622,95341,585,0002,028,0002,494,464
3Apr 21, 2026 10:0049,60072,565,89741,618,0002,030,0002,273,280
4Apr 21, 2026 10:0049,66266,571,58841,671,0002,032,0002,273,280
5Apr 21, 2026 10:0049,83769,612,20041,864,0001,993,0002,494,464
6Apr 21, 2026 10:0049,85274,532,41241,876,0001,994,0002,273,280
7Apr 21, 2026 10:0049,93867,679,92240,950,0002,996,0002,338,816
8Apr 21, 2026 10:0049,95260,520,84040,961,0002,997,0002,273,280
9Apr 21, 2026 10:0050,90157,657,69940,812,0003,981,0002,256,896