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:59Huy Duc LeHuy Duc LeScore: 68,584Success
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:5968,21652,638,84223,221,0002,019,0002,510,848
2Feb 22, 2024 07:5968,21948,550,51422,212,0003,029,0002,510,848
3Feb 22, 2024 07:5968,30048,167,89823,250,0002,021,0002,277,376
4Feb 22, 2024 07:5968,33251,595,52923,261,0002,022,0002,506,752
5Feb 22, 2024 07:5968,40349,918,15722,272,0003,037,0002,498,560
6Feb 22, 2024 07:5968,40346,296,52022,272,0003,037,0002,277,376
7Feb 22, 2024 07:5968,58450,810,99522,331,0003,045,0002,277,376
8Feb 22, 2024 07:5968,73546,703,70821,363,0004,069,0002,514,944
9Feb 22, 2024 07:5968,76250,159,38424,425,0001,017,0002,510,848
10Feb 22, 2024 07:5972,61092,800,14226,865,71502,187,264
11Feb 22, 2024 07:5972,891102,827,50226,969,68202,256,896
12Feb 22, 2024 07:5973,174107,545,99527,074,21302,256,896