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:23LiamLiamScore: 109,270Success
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:23108,37867,205,60639,098,0001,002,0002,289,664
2Feb 15, 2023 18:23108,63268,541,84938,185,0002,009,0002,289,664
3Feb 15, 2023 18:23108,66864,240,58138,197,0002,010,0002,396,160
4Feb 15, 2023 18:23108,76867,005,15239,238,0001,006,0002,289,664
5Feb 15, 2023 18:23108,80363,448,19938,245,0002,012,0002,289,664
6Feb 15, 2023 18:23108,85461,688,02838,263,0002,013,0002,281,472
7Feb 15, 2023 18:23109,27069,522,85339,420,0001,010,0002,289,664
8Feb 15, 2023 18:23109,31665,877,96239,436,0001,011,0002,289,664
9Feb 15, 2023 18:23109,57662,156,85339,530,0001,013,0002,289,664
10Feb 15, 2023 18:23111,920108,918,70441,410,26402,269,184
11Feb 15, 2023 18:23112,375118,094,66941,578,87602,265,088
12Feb 15, 2023 18:23112,741121,053,84141,714,02002,269,184