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:23Robert BurkeRobert BurkeScore: 62,830Success
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:2362,44641,988,06722,101,0001,004,0002,424,832
2Aug 2, 2022 08:2362,53544,529,06121,126,0002,012,0002,535,424
3Aug 2, 2022 08:2362,57348,667,00322,146,0001,006,0002,269,184
4Aug 2, 2022 08:2362,60846,794,52122,158,0001,007,0002,531,328
5Aug 2, 2022 08:2362,72743,859,70322,200,0001,009,0002,420,736
6Aug 2, 2022 08:2362,74947,122,48222,208,0001,009,0002,420,736
7Aug 2, 2022 08:2362,83049,105,51922,237,0001,010,0002,535,424
8Aug 2, 2022 08:2363,00547,999,28722,299,0001,013,0002,273,280
9Aug 2, 2022 08:2363,02447,287,49222,306,0001,013,0002,535,424
10Aug 2, 2022 08:2365,73680,919,39024,322,30402,281,472
11Aug 2, 2022 08:2365,946102,188,15324,399,90002,281,472
12Aug 2, 2022 08:2365,98889,679,68724,415,51802,269,184