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 25, 2024 17:33NoSIMD_C#NoSIMD_C#Score: 202,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 25, 2024 17:33201,445205,119,537174,268,0003,004,0002,293,760
2Nov 25, 2024 17:33201,878202,779,614176,650,0001,003,0002,293,760
3Nov 25, 2024 17:33202,122204,668,570174,870,0002,997,0002,527,232
4Nov 25, 2024 17:33202,205211,582,158173,942,0003,998,0002,297,856
5Nov 25, 2024 17:33202,297206,992,008177,021,0001,000,0002,539,520
6Nov 25, 2024 17:33202,327214,158,083173,047,0005,001,0002,297,856
7Nov 25, 2024 17:33202,344209,195,318177,063,0001,000,0002,301,952
8Nov 25, 2024 17:33202,692210,464,535177,367,0001,002,0002,539,520
9Nov 25, 2024 17:33202,815202,553,489176,472,0002,005,0002,293,760