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 listDec 19, 2025 19:09Wookyung JeongWookyung JeongScore: 309,475Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 19:09307,747298,945,352269,818,000999,0002,289,664
2Dec 19, 2025 19:09308,202293,927,771269,217,0002,001,0002,289,664
3Dec 19, 2025 19:09309,045297,526,952269,961,0001,999,0002,289,664
4Dec 19, 2025 19:09309,084295,254,718269,995,0001,999,0002,289,664
5Dec 19, 2025 19:09309,475293,640,844271,337,0001,001,0002,273,280
6Dec 19, 2025 19:09309,597296,854,386271,444,0001,001,0002,265,088
7Dec 19, 2025 19:09309,627306,500,647271,474,000998,0002,289,664
8Dec 19, 2025 19:09309,692299,689,826271,528,0001,001,0002,289,664
9Dec 19, 2025 19:09310,598300,721,902272,325,0001,001,0002,289,664