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 listSep 29, 2026 22:02Andrew EpsteinAndrew EpsteinScore: 4,803Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 22:054,76212,827,0754,191,000020,480
2Sep 29, 2026 22:054,77212,840,4564,200,000020,480
3Sep 29, 2026 22:054,78912,787,1154,215,000020,480
4Sep 29, 2026 22:054,79012,753,0354,216,000020,480
5Sep 29, 2026 22:054,80312,756,1584,227,000020,480
6Sep 29, 2026 22:054,82214,172,7404,244,000020,480
7Sep 29, 2026 22:054,82312,789,1824,245,000020,480
8Sep 29, 2026 22:054,82512,829,6084,246,000020,480
9Sep 29, 2026 22:054,87212,912,8884,288,000020,480