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 2, 2022 08:22Robert BurkeRobert BurkeScore: 62,784Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 08:2262,47843,528,54021,107,0002,010,0002,273,280
2Aug 2, 2022 08:2262,58649,412,24522,151,0001,006,0002,433,024
3Aug 2, 2022 08:2262,60348,537,74521,149,0002,014,0002,273,280
4Aug 2, 2022 08:2262,64948,247,04321,165,0002,015,0002,535,424
5Aug 2, 2022 08:2262,74346,669,74222,206,0001,009,0002,420,736
6Aug 2, 2022 08:2262,74640,853,63621,198,0002,018,0002,535,424
7Aug 2, 2022 08:2262,78447,972,63222,220,0001,010,0002,273,280
8Aug 2, 2022 08:2262,80847,023,01022,229,0001,010,0002,420,736
9Aug 2, 2022 08:2262,89242,386,92222,259,0001,011,0002,424,832
10Aug 2, 2022 08:2265,80592,417,91024,347,78102,252,800
11Aug 2, 2022 08:2266,07280,634,29724,446,61002,273,280
12Aug 2, 2022 08:2266,08879,237,83724,452,50702,269,184