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 25, 2022 01:06Kenneth MaplesKenneth MaplesScore: 76,462Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2022 01:0676,00555,087,28126,114,0002,008,0002,498,560
2Oct 25, 2022 01:0676,14352,844,25125,155,0003,018,0002,277,376
3Oct 25, 2022 01:0676,15955,206,37926,167,0002,012,0002,281,472
4Oct 25, 2022 01:0676,18654,673,97324,162,0004,027,0002,277,376
5Oct 25, 2022 01:0676,35760,017,30026,234,0002,018,0002,277,376
6Oct 25, 2022 01:0676,36858,811,18127,247,0001,009,0002,277,376
7Oct 25, 2022 01:0676,46253,478,70725,260,0003,031,0002,486,272
8Oct 25, 2022 01:0676,69257,921,94727,363,0001,013,0002,494,464
9Oct 25, 2022 01:0677,01656,657,06327,479,0001,017,0002,277,376
10Oct 25, 2022 01:0680,78494,013,66129,890,23902,220,032
11Oct 25, 2022 01:0680,946105,717,49529,950,16302,228,224
12Oct 25, 2022 01:0681,201105,821,21330,044,50702,224,128