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 listSep 1, 2022 00:12Yurkov AlekseyYurkov AlekseyScore: 166,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2022 00:12101,675110,141,06537,619,56502,269,184
2Sep 1, 2022 00:12101,720116,048,76337,636,27102,273,280
3Sep 1, 2022 00:12102,380105,406,68737,880,53802,269,184
4Sep 1, 2022 00:12165,85984,072,29059,356,0002,012,0002,273,280
5Sep 1, 2022 00:12166,68187,882,26960,661,0001,011,0002,273,280
6Sep 1, 2022 00:12166,77084,721,69660,694,0001,011,0002,392,064
7Sep 1, 2022 00:12166,88987,618,74161,749,00002,289,664
8Sep 1, 2022 00:12167,10589,550,91960,832,000997,0002,289,664
9Sep 1, 2022 00:12167,17687,516,98560,858,000997,0002,289,664
10Sep 1, 2022 00:12167,28684,989,01660,898,000998,0002,289,664
11Sep 1, 2022 00:12167,56886,818,83460,000,0002,000,0002,277,376
12Sep 1, 2022 00:12169,96587,776,51461,889,000998,0002,527,232