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 6, 2022 18:28Franek KortaFranek KortaScore: 78,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2022 18:2877,92460,096,94026,844,0001,988,0002,285,568
2Aug 6, 2022 18:2877,95155,620,49026,853,0001,989,0002,281,472
3Aug 6, 2022 18:2877,96855,891,75825,864,0002,984,0002,281,472
4Aug 6, 2022 18:2877,99559,889,87226,868,0001,990,0002,523,136
5Aug 6, 2022 18:2878,02251,147,17526,878,0001,990,0002,269,184
6Aug 6, 2022 18:2878,06553,236,02427,888,000996,0002,285,568
7Aug 6, 2022 18:2878,11650,843,25226,910,0001,993,0002,281,472
8Aug 6, 2022 18:2878,15452,888,92725,926,0002,991,0002,281,472
9Aug 6, 2022 18:2878,24652,140,55223,960,0004,991,0002,281,472
10Aug 6, 2022 18:2882,86683,395,98830,660,31702,265,088
11Aug 6, 2022 18:2883,00994,808,21130,713,22202,252,800
12Aug 6, 2022 18:2883,369105,810,45930,846,48102,260,992