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 24, 2023 21:06mmalczakmmalczakScore: 74,676Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2023 21:0673,54952,438,81526,206,0001,007,0002,273,280
2Sep 24, 2023 21:0673,93550,917,24725,330,0002,026,0002,289,664
3Sep 24, 2023 21:0674,07350,308,35125,377,0002,030,0002,289,664
4Sep 24, 2023 21:0674,25450,121,88026,457,0001,017,0002,531,328
5Sep 24, 2023 21:0674,42455,145,11026,518,0001,019,0002,289,664
6Sep 24, 2023 21:0674,55454,220,19926,564,0001,021,0002,289,664
7Sep 24, 2023 21:0674,67657,831,16826,607,0001,023,0002,289,664
8Sep 24, 2023 21:0675,26854,117,83726,855,000994,0002,289,664
9Sep 24, 2023 21:0675,30354,980,58527,862,00002,277,376
10Sep 24, 2023 21:0676,37690,807,71328,258,97302,273,280
11Sep 24, 2023 21:0676,66895,710,93728,367,26502,273,280
12Sep 24, 2023 21:0676,89596,167,02228,451,05502,273,280