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 listAug 2, 2022 08:59Robert BurkeRobert BurkeScore: 65,744Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 08:5965,73284,763,90924,321,01002,289,664
2Aug 2, 2022 08:5965,74482,421,35024,325,31202,281,472
3Aug 2, 2022 08:5965,81783,029,52924,352,44402,281,472