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:09Huy Duc LeHuy Duc LeScore: 93,541Success
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:0991,96254,942,41133,026,0001,000,0002,285,568
2Feb 21, 2024 16:0992,66264,104,39332,269,0002,016,0002,527,232
3Feb 21, 2024 16:0992,77360,619,84232,307,0002,019,0002,527,232
4Feb 21, 2024 16:0992,95760,086,88133,383,0001,011,0002,281,472
5Feb 21, 2024 16:0993,02258,661,89333,406,0001,012,0002,269,184
6Feb 21, 2024 16:0993,38455,080,67232,520,0002,032,0002,281,472
7Feb 21, 2024 16:0993,54164,254,97333,593,0001,017,0002,523,136
8Feb 21, 2024 16:0994,19759,327,58030,870,0003,983,0002,523,136
9Feb 21, 2024 16:0994,21956,263,87732,869,0001,992,0002,281,472
10Feb 21, 2024 16:0996,281119,966,50035,624,06002,240,512
11Feb 21, 2024 16:0996,852106,635,60635,835,08602,277,376
12Feb 21, 2024 16:0997,855114,776,15336,206,44702,273,280