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 22, 2026 08:49Pavel SkripkinPavel SkripkinScore: 279,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 08:50276,528262,781,993242,344,0001,001,0002,424,832
2Apr 22, 2026 08:50278,675259,056,784244,234,0001,000,0002,424,832
3Apr 22, 2026 08:50278,912260,223,340244,442,0001,001,0002,416,640
4Apr 22, 2026 08:50278,968262,959,661244,490,0001,002,0002,424,832
5Apr 22, 2026 08:50279,020261,637,645244,536,0001,002,0002,424,832
6Apr 22, 2026 08:50280,238260,359,764245,608,0001,002,0002,424,832
7Apr 22, 2026 08:50280,755264,571,548245,065,0002,000,0002,428,928
8Apr 22, 2026 08:50281,127265,108,465246,391,0001,001,0002,428,928
9Apr 22, 2026 08:50281,679266,005,159245,879,0001,999,0002,424,832