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 21:48mmalczakmmalczakScore: 74,498Success
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 21:4874,44494,143,81427,544,36502,260,992
2Sep 25, 2023 21:4874,49896,224,00227,564,44302,265,088
3Sep 25, 2023 21:4874,79495,830,86527,673,75402,265,088