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 listFeb 21, 2024 16:01Huy Duc LeHuy Duc LeScore: 94,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2024 16:0192,04656,321,58932,054,0002,003,0002,281,472
2Feb 21, 2024 16:0193,13562,493,36433,447,0001,013,0002,281,472
3Feb 21, 2024 16:0193,16860,304,89232,445,0002,027,0002,281,472
4Feb 21, 2024 16:0193,41160,235,45233,546,0001,016,0002,281,472
5Feb 21, 2024 16:0193,47060,714,81032,550,0002,034,0002,277,376
6Feb 21, 2024 16:0193,70365,026,79934,670,00002,281,472
7Feb 21, 2024 16:0194,16858,568,18631,856,0002,986,0002,281,472
8Feb 21, 2024 16:0194,18660,566,62233,854,000995,0002,514,944
9Feb 21, 2024 16:0194,24167,981,22632,877,0001,992,0002,514,944
10Feb 21, 2024 16:0196,822121,170,99735,824,06102,265,088
11Feb 21, 2024 16:0196,95299,758,80935,872,16202,260,992
12Feb 21, 2024 16:0197,91397,918,73636,227,65302,232,320