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 listAug 6, 2022 20:12Franek KortaFranek KortaScore: 74,919Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2022 20:1274,48947,731,31425,520,0002,041,0002,527,232
2Aug 6, 2022 20:1274,62454,429,37126,589,0001,022,0002,285,568
3Aug 6, 2022 20:1274,66254,870,65326,602,0001,023,0002,535,424
4Aug 6, 2022 20:1274,77353,930,08025,617,0002,049,0002,383,872
5Aug 6, 2022 20:1274,82760,788,71125,636,0002,050,0002,281,472
6Aug 6, 2022 20:1274,83558,333,23727,689,00002,281,472
7Aug 6, 2022 20:1274,91954,027,87726,694,0001,026,0002,527,232
8Aug 6, 2022 20:1275,27855,252,84423,874,0003,979,0002,281,472
9Aug 6, 2022 20:1275,29754,234,62926,865,000995,0002,277,376
10Aug 6, 2022 20:1278,762100,498,16129,142,08302,265,088
11Aug 6, 2022 20:1278,95993,372,69329,214,78202,265,088
12Aug 6, 2022 20:1279,18878,439,26829,299,71502,293,760