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 15:26apuxbtapuxbtScore: 132,662Success
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 15:26132,596109,161,05949,060,38002,265,088
2Sep 28, 2023 15:26132,662118,923,29749,085,06102,269,184
3Sep 28, 2023 15:26132,831123,270,02749,147,36702,269,184