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 28, 2023 17:15mmalczakmmalczakScore: 72,845Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 17:1572,563101,897,41726,848,23002,285,568
2Sep 28, 2023 17:1572,84580,293,44826,952,60002,281,472
3Sep 28, 2023 17:1573,05391,310,27627,029,61002,285,568