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:49Kenneth MaplesKenneth MaplesScore: 74,716Success
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:4974,20350,488,08626,439,0001,016,0002,277,376
2Oct 13, 2022 19:4974,23849,993,46926,451,0001,017,0002,498,560
3Oct 13, 2022 19:4974,26252,360,90727,477,00002,498,560
4Oct 13, 2022 19:4974,34652,957,01325,471,0002,037,0002,281,472
5Oct 13, 2022 19:4974,44151,677,87225,503,0002,040,0002,494,464
6Oct 13, 2022 19:4974,53857,287,93426,558,0001,021,0002,498,560
7Oct 13, 2022 19:4974,71657,653,93426,622,0001,023,0002,494,464
8Oct 13, 2022 19:4974,77858,786,30925,619,0002,049,0002,277,376
9Oct 13, 2022 19:4974,85751,459,41726,672,0001,025,0002,277,376
10Oct 13, 2022 19:4978,83294,815,79329,167,66902,232,320
11Oct 13, 2022 19:4979,122109,360,50129,275,30602,224,128
12Oct 13, 2022 19:4979,61694,519,78629,457,97602,220,032