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 5, 2022 20:13Franek KortaFranek KortaScore: 82,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2022 20:1379,66556,094,54728,460,0001,016,0002,281,472
2Aug 5, 2022 20:1379,96256,940,26528,566,0001,020,0002,281,472
3Aug 5, 2022 20:1380,20061,004,86227,628,0002,046,0002,281,472
4Aug 5, 2022 20:1380,95452,809,99728,955,000998,0002,281,472
5Aug 5, 2022 20:1381,37353,335,93028,101,0002,007,0002,285,568
6Aug 5, 2022 20:1382,07053,194,11127,330,0003,036,0002,269,184
7Aug 5, 2022 20:1382,97056,254,89028,653,0002,046,0002,277,376
8Aug 5, 2022 20:1383,38657,627,71228,863,0001,990,0002,281,472
9Aug 5, 2022 20:1384,49753,801,75429,247,0002,017,0002,269,184
10Aug 5, 2022 20:1386,134107,496,27031,869,63802,265,088
11Aug 5, 2022 20:1387,572104,217,33832,401,82102,256,896
12Aug 5, 2022 20:1388,559105,545,99532,767,01402,256,896