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:12mmalczakmmalczakScore: 74,742Success
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:1274,54298,376,85127,580,51202,265,088
2Sep 25, 2023 22:1274,74289,592,49527,654,72002,265,088
3Sep 25, 2023 22:1274,830106,881,99027,687,05302,269,184