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 23, 2026 19:13Pavel SkripkinPavel SkripkinScore: 173,075Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 19:14172,020168,512,192150,376,0001,002,0002,420,736
2Apr 23, 2026 19:14172,356165,780,206150,670,0001,004,0002,420,736
3Apr 23, 2026 19:14172,705164,305,575149,982,0001,999,0002,326,528
4Apr 23, 2026 19:14172,805170,699,324150,069,0002,000,0002,433,024
5Apr 23, 2026 19:14173,075168,357,645151,304,0001,002,0002,334,720
6Apr 23, 2026 19:14173,388171,165,059151,579,0001,003,0002,424,832
7Apr 23, 2026 19:14174,010168,020,452152,129,0001,000,0002,428,928
8Apr 23, 2026 19:14174,272172,606,241152,358,0001,002,0002,420,736
9Apr 23, 2026 19:14174,892167,686,322151,907,0001,998,0002,420,736