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 listApr 22, 2025 10:05NoSIMD_C#NoSIMD_C#Score: 167,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2025 10:05167,15791,545,05960,835,0001,013,0002,523,136
2Apr 22, 2025 10:05167,65186,807,88960,030,0002,001,0002,551,808
3Apr 22, 2025 10:05169,12489,887,52561,567,0001,009,0002,297,856