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:08Kenneth MaplesKenneth MaplesScore: 73,768Success
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:0873,39750,724,90326,152,0001,005,0002,277,376
2Oct 24, 2022 21:0873,41447,501,74324,145,0003,018,0002,498,560
3Oct 24, 2022 21:0873,49550,906,47324,172,0003,021,0002,498,560
4Oct 24, 2022 21:0873,63246,344,46626,235,0001,009,0002,494,464
5Oct 24, 2022 21:0873,65148,244,14125,233,0002,018,0002,494,464
6Oct 24, 2022 21:0873,74654,068,24525,265,0002,021,0002,277,376
7Oct 24, 2022 21:0873,76849,380,19625,273,0002,021,0002,490,368
8Oct 24, 2022 21:0873,84960,342,07025,300,0002,024,0002,277,376
9Oct 24, 2022 21:0873,97849,095,97925,345,0002,027,0002,347,008
10Oct 24, 2022 21:0877,932112,891,67328,835,01002,224,128
11Oct 24, 2022 21:0878,309102,055,13628,974,38402,228,224
12Oct 24, 2022 21:0878,52896,041,03629,055,42602,220,032