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 listFeb 17, 2023 19:18LiamLiamScore: 99,337Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2023 19:1899,210106,093,44236,707,61002,265,088
2Feb 17, 2023 19:1899,33796,405,48936,754,57002,256,896
3Feb 17, 2023 19:1899,853101,100,16836,945,63702,273,280