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 listJan 23, 2025 08:35NoSIMD_C#NoSIMD_C#Score: 201,064Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 08:35200,535198,626,774175,469,0001,002,0002,289,664
2Jan 23, 2025 08:35200,792203,067,006174,701,0001,996,0002,289,664
3Jan 23, 2025 08:35200,931202,563,674174,822,0001,997,0002,297,856
4Jan 23, 2025 08:35201,026206,318,971173,905,0002,998,0002,547,712
5Jan 23, 2025 08:35201,064204,415,370172,938,0003,998,0002,535,424
6Jan 23, 2025 08:35201,164208,876,305174,024,0003,000,0002,301,952
7Jan 23, 2025 08:35201,290206,590,064174,133,0003,002,0002,289,664
8Jan 23, 2025 08:35202,056201,102,412176,811,000998,0002,535,424
9Jan 23, 2025 08:35203,319204,301,799174,901,0004,020,0002,523,136