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 listOct 13, 2022 19:56Kenneth MaplesKenneth MaplesScore: 73,630Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2022 19:5673,07847,546,60624,035,0003,004,0002,281,472
2Oct 13, 2022 19:5673,33249,759,90425,124,0002,009,0002,490,368
3Oct 13, 2022 19:5673,35952,966,75923,122,0004,021,0002,498,560
4Oct 13, 2022 19:5673,36252,590,82325,134,0002,010,0002,490,368
5Oct 13, 2022 19:5673,37654,395,47925,138,0002,011,0002,277,376
6Oct 13, 2022 19:5673,39747,541,86124,140,0003,017,0002,498,560
7Oct 13, 2022 19:5673,63048,528,68524,216,0003,027,0002,281,472
8Oct 13, 2022 19:5673,71149,596,03625,253,0002,020,0002,494,464
9Oct 13, 2022 19:5673,73849,392,49024,252,0003,031,0002,277,376
10Oct 13, 2022 19:5677,60493,080,10628,713,61302,236,416
11Oct 13, 2022 19:5678,069105,150,51328,885,42002,232,320
12Oct 13, 2022 19:5678,119102,234,71128,903,91102,228,224