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 listMay 12, 2023 23:25Yurkov AlekseyYurkov AlekseyScore: 119,184Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2023 23:25118,51675,943,53142,855,000996,0002,289,664
2May 12, 2023 23:25118,57865,877,74841,880,0001,994,0002,289,664
3May 12, 2023 23:25118,60871,228,47541,891,0001,994,0002,289,664
4May 12, 2023 23:25118,61672,406,89641,894,0001,994,0002,269,184
5May 12, 2023 23:25118,63269,162,06343,894,00002,519,040
6May 12, 2023 23:25118,70567,176,57741,925,0001,996,0002,523,136
7May 12, 2023 23:25119,18466,835,74442,094,0002,004,0002,277,376
8May 12, 2023 23:25119,28467,441,05842,129,0002,006,0002,269,184
9May 12, 2023 23:25119,29567,977,36443,136,0001,003,0002,289,664
10May 12, 2023 23:25121,978104,386,44445,131,97402,265,088
11May 12, 2023 23:25122,574123,289,57845,352,31502,260,992
12May 12, 2023 23:25122,993100,521,97945,507,56002,256,896