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 4, 2022 20:13Franek KortaFranek KortaScore: 77,368Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2022 20:1375,21653,644,60025,843,0001,987,0002,273,280
2Aug 4, 2022 20:1375,26256,239,48224,864,0002,983,0002,281,472
3Aug 4, 2022 20:1375,76253,098,28326,030,0002,002,0002,281,472
4Aug 4, 2022 20:1375,81452,139,90725,046,0003,005,0002,269,184
5Aug 4, 2022 20:1376,33850,805,74426,228,0002,017,0002,527,232
6Aug 4, 2022 20:1376,67053,222,30626,342,0002,026,0002,527,232
7Aug 4, 2022 20:1377,36859,627,74625,559,0003,067,0002,281,472
8Aug 4, 2022 20:1379,51652,728,62828,407,0001,014,0002,281,472
9Aug 4, 2022 20:1380,68662,478,08627,864,0001,990,0002,281,472
10Aug 4, 2022 20:1382,01885,191,04430,346,51302,265,088
11Aug 4, 2022 20:1383,78297,195,87230,999,38702,269,184
12Aug 4, 2022 20:1384,013103,034,51331,084,88102,256,896