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 5, 2023 17:07apuxbtapuxbtScore: 73,527Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2023 17:0772,83046,626,18224,951,0001,996,0002,523,136
2Oct 5, 2023 17:0772,92754,209,83023,985,0002,998,0002,285,568
3Oct 5, 2023 17:0773,04953,835,08625,026,0002,002,0002,293,760
4Oct 5, 2023 17:0773,10053,314,32125,044,0002,003,0002,531,328
5Oct 5, 2023 17:0773,10847,413,48925,047,0002,003,0002,359,296
6Oct 5, 2023 17:0773,49249,722,49725,178,0002,014,0002,293,760
7Oct 5, 2023 17:0773,52763,810,82325,190,0002,015,0002,293,760
8Oct 5, 2023 17:0773,97858,159,12625,345,0002,027,0002,523,136
9Oct 5, 2023 17:0774,10852,391,34525,389,0002,031,0002,523,136
10Oct 5, 2023 17:0777,07487,749,02728,517,46802,265,088
11Oct 5, 2023 17:0777,14689,593,04828,543,84802,265,088
12Oct 5, 2023 17:0777,66397,910,80428,735,49402,256,896