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 20:29Kenneth MaplesKenneth MaplesScore: 73,762Success
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 20:2973,44350,884,51626,168,0001,006,0002,498,560
2Oct 24, 2022 20:2973,48451,043,75926,182,0001,007,0002,277,376
3Oct 24, 2022 20:2973,53246,969,35525,192,0002,015,0002,277,376
4Oct 24, 2022 20:2973,60348,927,21125,216,0002,017,0002,498,560
5Oct 24, 2022 20:2973,65750,104,22425,235,0002,018,0002,281,472
6Oct 24, 2022 20:2973,67356,410,24525,240,0002,019,0002,498,560
7Oct 24, 2022 20:2973,76250,354,24326,282,0001,010,0002,281,472
8Oct 24, 2022 20:2973,99557,224,07524,336,0003,042,0002,502,656
9Oct 24, 2022 20:2974,21950,277,26926,444,0001,017,0002,277,376
10Oct 24, 2022 20:2978,30298,446,44628,971,59302,220,032
11Oct 24, 2022 20:2978,31980,870,74528,978,07602,224,128
12Oct 24, 2022 20:2978,550116,058,25329,063,42002,215,936