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 2, 2023 22:54Franek KortaFranek KortaScore: 65,117Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2023 22:5464,84188,864,19823,991,22602,297,856
2Sep 2, 2023 22:5465,117101,610,12224,093,24302,297,856
3Sep 2, 2023 22:5465,34389,429,10824,176,84302,170,880