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 22, 2024 07:03Huy Duc LeHuy Duc LeScore: 74,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2024 07:0373,77050,270,40724,263,0003,032,0002,273,280
2Feb 22, 2024 07:0373,90348,188,72625,319,0002,025,0002,506,752
3Feb 22, 2024 07:0373,99557,449,87223,322,0004,056,0002,273,280
4Feb 22, 2024 07:0374,03549,767,11625,364,0002,029,0002,510,848
5Feb 22, 2024 07:0374,04650,766,47125,368,0002,029,0002,277,376
6Feb 22, 2024 07:0374,15954,531,63025,407,0002,032,0002,506,752
7Feb 22, 2024 07:0374,37853,784,99526,501,0001,019,0002,273,280
8Feb 22, 2024 07:0374,41156,498,60327,532,00002,514,944
9Feb 22, 2024 07:0374,51157,862,05626,548,0001,021,0002,273,280
10Feb 22, 2024 07:0378,26498,132,23928,957,62302,260,992
11Feb 22, 2024 07:0378,43199,343,11529,019,52202,293,760
12Feb 22, 2024 07:0378,735103,658,35829,131,80402,244,608