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 28, 2023 20:55Franek KortaFranek KortaScore: 75,251Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2023 20:5574,27052,124,76726,463,0001,017,0002,514,944
2Aug 28, 2023 20:5574,29252,622,20727,488,00002,514,944
3Aug 28, 2023 20:5574,37645,758,88427,519,00002,514,944
4Aug 28, 2023 20:5574,38648,106,69926,504,0001,019,0002,424,832
5Aug 28, 2023 20:5574,67855,028,94926,608,0001,023,0002,514,944
6Aug 28, 2023 20:5574,81154,972,04527,680,00002,428,928
7Aug 28, 2023 20:5575,25153,273,53226,849,000994,0002,519,040
8Aug 28, 2023 20:5575,27056,736,49025,861,0001,989,0002,428,928
9Aug 28, 2023 20:5575,39755,217,09625,905,0001,992,0002,514,944
10Aug 28, 2023 20:5578,74187,800,56729,134,01202,277,376
11Aug 28, 2023 20:5579,188107,321,25229,299,41102,269,184
12Aug 28, 2023 20:5579,53695,640,46529,428,44802,277,376