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 21, 2023 18:29mmalczakmmalczakScore: 85,780Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2023 18:2985,30098,227,08431,560,88102,260,992
2Sep 21, 2023 18:2985,780101,356,00831,738,69902,260,992
3Sep 21, 2023 18:2986,44099,426,28831,982,94402,260,992