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 25, 2023 22:46mmalczakmmalczakScore: 74,290Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2023 22:4674,17694,192,53027,445,21902,256,896
2Sep 25, 2023 22:4674,29091,049,22527,487,37002,265,088
3Sep 25, 2023 22:4674,50397,780,83627,566,25602,269,184