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 09:54NoSIMD_C#NoSIMD_C#Score: 168,465Success
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 09:54168,15191,208,62459,206,0003,010,0002,535,424
2Apr 22, 2025 09:54168,46593,556,35559,316,0003,016,0002,285,568
3Apr 22, 2025 09:54169,34190,135,73961,646,0001,010,0002,301,952