TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listNov 6, 2024 16:02NoSIMD_C#NoSIMD_C#Score: 21,553,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 16:0221,501,9118,003,326,9337,753,892,000201,815,0002,281,472
2Nov 6, 2024 16:0221,514,2197,992,823,7177,763,403,000196,858,0002,293,760
3Nov 6, 2024 16:0221,517,5897,997,864,8717,763,645,000197,863,0002,408,448
4Nov 6, 2024 16:0221,519,2597,996,716,6877,765,272,000196,854,0002,281,472
5Nov 6, 2024 16:0221,553,6088,010,199,8247,777,988,000196,847,0002,281,472
6Nov 6, 2024 16:0221,631,2548,036,289,0817,806,723,000196,841,0002,281,472
7Nov 6, 2024 16:0221,652,4598,053,111,5947,802,582,000208,828,0002,281,472
8Nov 6, 2024 16:0221,653,9278,041,928,3237,815,102,000196,851,0002,281,472
9Nov 6, 2024 16:0221,737,8388,077,264,4717,845,148,000197,852,0002,281,472