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 listMar 26, 2023 11:27Yurkov AlekseyYurkov AlekseyScore: 99,014Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2023 11:2797,44657,114,70934,052,0002,003,0002,289,664
2Mar 26, 2023 11:2797,74158,608,15534,155,0002,009,0002,289,664
3Mar 26, 2023 11:2797,77659,041,91934,168,0002,009,0002,289,664
4Mar 26, 2023 11:2798,03862,891,16834,259,0002,015,0002,523,136
5Mar 26, 2023 11:2798,54363,373,30535,449,0001,012,0002,277,376
6Mar 26, 2023 11:2798,64663,050,58235,486,0001,013,0002,273,280
7Mar 26, 2023 11:2799,01469,224,39235,618,0001,017,0002,289,664
8Mar 26, 2023 11:2799,13566,269,34235,662,0001,018,0002,289,664
9Mar 26, 2023 11:2799,137119,589,24436,680,83102,269,184
10Mar 26, 2023 11:2799,23394,898,99536,716,25402,265,088
11Mar 26, 2023 11:2799,94361,867,39634,981,0001,998,0002,265,088
12Mar 26, 2023 11:27100,603119,728,49437,223,06202,260,992