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 20, 2026 20:29Pavel SkripkinPavel SkripkinScore: 676,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 20:30670,194613,040,455587,772,0001,999,0002,347,008
2Apr 20, 2026 20:30670,954615,446,308589,440,0001,000,0002,269,184
3Apr 20, 2026 20:30673,015614,388,755591,254,0001,000,0002,359,296
4Apr 20, 2026 20:30674,337626,025,070592,417,0001,000,0002,351,104
5Apr 20, 2026 20:30676,218606,476,823593,072,0002,000,0002,273,280
6Apr 20, 2026 20:30681,437621,085,900596,667,0002,998,0002,359,296
7Apr 20, 2026 20:30684,919630,578,377600,730,0001,999,0002,363,392
8Apr 20, 2026 20:30690,272636,341,983606,440,0001,000,0002,265,088
9Apr 20, 2026 20:30710,818652,483,917623,522,0001,998,0002,269,184