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 15, 2023 18:36LiamLiamError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2023 18:3600000Error: No answer to stdout. Died or killed?stderr
2Feb 15, 2023 18:3600000Error: No answer to stdout. Died or killed?stderr
3Feb 15, 2023 18:3700000Error: expected "429496518099 ", got "429496505045 "stderr
4Feb 15, 2023 18:3800000Error: No answer to stdout. Died or killed?stderr
5Feb 15, 2023 18:3793,48391,482,51334,588,72202,252,800
6Feb 15, 2023 18:3793,73496,721,18634,681,69002,260,992
7Feb 15, 2023 18:3793,958111,164,89534,764,27902,265,088
8Feb 15, 2023 18:3794,63299,785,18935,013,67902,269,184
9Feb 15, 2023 18:3794,919100,147,14935,120,15402,265,088
10Feb 15, 2023 18:3795,716101,981,31635,414,87102,260,992
11Feb 15, 2023 18:3796,050112,102,14035,538,61202,265,088
12Feb 15, 2023 18:3796,42595,152,51135,677,32302,256,896
13Feb 15, 2023 18:3796,891103,682,40735,849,56802,244,608