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 listNov 26, 2024 06:14NoSIMD_C#NoSIMD_C#Score: 202,074Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 26, 2024 06:14201,800207,411,319174,575,0003,009,0002,306,048
2Nov 26, 2024 06:14202,059203,338,013174,816,0002,996,0002,539,520
3Nov 26, 2024 06:14202,074204,505,045175,827,0001,998,0002,301,952
4Nov 26, 2024 06:14202,074201,355,136172,830,0004,995,0002,293,760
5Nov 26, 2024 06:14202,074204,707,073175,827,0001,998,0002,539,520
6Nov 26, 2024 06:14202,286208,801,695177,012,0001,000,0002,535,424
7Nov 26, 2024 06:14202,334206,390,287176,054,0002,000,0002,297,856
8Nov 26, 2024 06:14202,461204,168,043175,164,0003,002,0002,408,448
9Nov 26, 2024 06:14202,813209,893,609175,484,0002,991,0002,535,424