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 listJul 14, 2021 13:33Yuriy LyfenkoYuriy LyfenkoScore: 89,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2021 13:3388,554564,236,30930,780,0001,985,0002,326,528
2Jul 14, 2021 13:3388,595555,763,54331,787,000993,0002,330,624
3Jul 14, 2021 13:3388,876558,792,70229,895,0002,989,0002,326,528
4Jul 14, 2021 13:3389,030560,241,50130,945,0001,996,0002,510,848
5Jul 14, 2021 13:3389,086562,465,69829,966,0002,996,0002,330,624
6Jul 14, 2021 13:3389,349559,955,24531,056,0002,003,0002,326,528
7Jul 14, 2021 13:3389,430595,272,90733,089,08702,252,800
8Jul 14, 2021 13:3389,505559,476,01831,110,0002,007,0002,326,528
9Jul 14, 2021 13:3389,697555,392,73731,177,0002,011,0002,330,624
10Jul 14, 2021 13:3389,738553,332,77531,191,0002,012,0002,514,944
11Jul 14, 2021 13:3390,108587,814,06233,340,12002,252,800
12Jul 14, 2021 13:3390,145591,801,43133,353,62402,248,704