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 24, 2022 21:00Kenneth MaplesKenneth MaplesScore: 73,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2022 21:0073,53047,967,08525,191,0002,015,0002,494,464
2Oct 24, 2022 21:0073,54350,021,74725,196,0002,015,0002,498,560
3Oct 24, 2022 21:0073,56854,862,82325,204,0002,016,0002,490,368
4Oct 24, 2022 21:0073,61153,411,61925,219,0002,017,0002,490,368
5Oct 24, 2022 21:0073,68648,751,32224,235,0003,029,0002,277,376
6Oct 24, 2022 21:0073,70555,109,20625,251,0002,020,0002,277,376
7Oct 24, 2022 21:0073,88455,200,04324,300,0003,037,0002,494,464
8Oct 24, 2022 21:0074,10055,279,17525,387,0002,030,0002,277,376
9Oct 24, 2022 21:0074,13051,012,36626,413,0001,015,0002,498,560
10Oct 24, 2022 21:0078,000105,903,03728,859,99202,224,128
11Oct 24, 2022 21:0078,44295,046,46829,023,42402,228,224
12Oct 24, 2022 21:0078,580106,440,42429,074,63702,224,128