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:50Robert BurkeRobert BurkeScore: 62,997Success
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:5062,60344,636,83422,156,0001,007,0002,424,832
2Aug 2, 2022 08:5062,67644,552,21722,182,0001,008,0002,433,024
3Aug 2, 2022 08:5062,67644,937,63421,174,0002,016,0002,281,472
4Aug 2, 2022 08:5062,68443,548,56922,185,0001,008,0002,424,832
5Aug 2, 2022 08:5062,85144,889,74621,233,0002,022,0002,281,472
6Aug 2, 2022 08:5062,98445,310,65822,291,0001,013,0002,281,472
7Aug 2, 2022 08:5062,99751,413,45622,296,0001,013,0002,433,024
8Aug 2, 2022 08:5063,02450,556,88021,292,0002,027,0002,281,472
9Aug 2, 2022 08:5063,07043,613,82622,322,0001,014,0002,510,848
10Aug 2, 2022 08:5065,68777,134,42924,304,32402,260,992
11Aug 2, 2022 08:5065,80375,151,93924,347,14702,277,376
12Aug 2, 2022 08:5066,22079,342,72124,501,42202,285,568