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:11NoSIMD_C#NoSIMD_C#Score: 168,668Success
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:11168,23888,532,48760,240,0002,008,0002,551,808
2Apr 22, 2025 10:11168,66896,844,72360,394,0002,013,0002,535,424
3Apr 22, 2025 10:11171,04990,983,47761,279,0002,009,0002,535,424