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 15, 2023 17:15LiamLiamScore: 100,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2023 17:1598,89562,679,18235,575,0001,016,0002,289,664
2Feb 15, 2023 17:1599,57863,906,61034,853,0001,991,0002,289,664
3Feb 15, 2023 17:1599,58665,010,24834,856,0001,991,0002,289,664
4Feb 15, 2023 17:1599,76259,989,56135,915,000997,0002,281,472
5Feb 15, 2023 17:1599,80859,709,57734,933,0001,996,0002,289,664
6Feb 15, 2023 17:1599,81159,957,72535,932,000998,0002,269,184
7Feb 15, 2023 17:15100,13565,584,27335,048,0002,002,0002,289,664
8Feb 15, 2023 17:15100,47060,059,16635,165,0002,009,0002,277,376
9Feb 15, 2023 17:15100,59260,391,26835,208,0002,011,0002,281,472
10Feb 15, 2023 17:15101,403100,185,27737,519,17702,256,896
11Feb 15, 2023 17:15101,960105,160,92137,725,07802,252,800
12Feb 15, 2023 17:15102,369107,086,46137,876,52402,277,376