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 listDec 13, 2024 07:59NoSIMD_C#NoSIMD_C#Score: 274,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 13, 2024 07:59273,559126,646,39955,118,00046,099,0002,535,424
2Dec 13, 2024 07:59274,586124,976,32667,396,00034,201,0002,465,792
3Dec 13, 2024 07:59275,514126,646,45764,962,00036,978,0002,473,984