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 08:03Huy Duc LeHuy Duc LeScore: 75,273Success
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 08:0373,62253,295,44525,223,0002,017,0002,273,280
2Feb 22, 2024 08:0374,47058,494,98323,472,0004,082,0002,514,944
3Feb 22, 2024 08:0374,69556,180,01025,590,0002,047,0002,347,008
4Feb 22, 2024 08:0374,83257,891,47426,663,0001,025,0002,273,280
5Feb 22, 2024 08:0375,22252,421,60925,844,0001,988,0002,355,200
6Feb 22, 2024 08:0375,23056,670,35224,853,0002,982,0002,273,280
7Feb 22, 2024 08:0375,27353,725,83827,851,00002,330,624
8Feb 22, 2024 08:0375,27361,806,92525,862,0001,989,0002,506,752
9Feb 22, 2024 08:0375,35153,395,95924,893,0002,987,0002,506,752
10Feb 22, 2024 08:0379,31289,906,90629,345,60602,265,088
11Feb 22, 2024 08:0379,51099,425,60429,418,64602,248,704
12Feb 22, 2024 08:0379,602106,302,72029,452,73002,256,896