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 listSep 16, 2023 10:16mmalczakmmalczakScore: 191,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2023 10:16190,797134,837,92070,594,89702,265,088
2Sep 16, 2023 10:16191,138169,521,99670,720,94402,252,800
3Sep 16, 2023 10:16192,235139,754,80371,127,10202,260,992