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:59Kenneth MaplesKenneth MaplesScore: 73,689Success
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:5973,08452,704,84025,038,0002,003,0002,277,376
2Oct 13, 2022 19:5973,12454,121,21524,050,0003,006,0002,494,464
3Oct 13, 2022 19:5973,21951,992,75825,085,0002,006,0002,277,376
4Oct 13, 2022 19:5973,37649,149,39425,138,0002,011,0002,314,240
5Oct 13, 2022 19:5973,43253,664,36325,158,0002,012,0002,277,376
6Oct 13, 2022 19:5973,47353,169,43025,172,0002,013,0002,490,368
7Oct 13, 2022 19:5973,68956,484,26724,236,0003,029,0002,527,232
8Oct 13, 2022 19:5973,74353,765,72025,264,0002,021,0002,314,240
9Oct 13, 2022 19:5973,74650,685,49425,265,0002,021,0002,498,560
10Oct 13, 2022 19:5977,56396,675,11428,698,40302,228,224
11Oct 13, 2022 19:5978,04495,534,25528,876,18002,220,032
12Oct 13, 2022 19:5978,113100,560,39128,901,97702,228,224