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 04:10Huy Duc LeHuy Duc LeScore: 72,903Success
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 04:1072,56551,571,16425,855,000994,0002,277,376
2Feb 22, 2024 04:1072,56857,080,69423,867,0002,983,0002,506,752
3Feb 22, 2024 04:1072,61452,634,23123,882,0002,985,0002,273,280
4Feb 22, 2024 04:1072,66552,590,83124,895,0001,991,0002,273,280
5Feb 22, 2024 04:1072,73053,472,12322,924,0003,986,0002,510,848
6Feb 22, 2024 04:1072,89253,813,04024,973,0001,997,0002,510,848
7Feb 22, 2024 04:1072,90355,926,94924,976,0001,998,0002,273,280
8Feb 22, 2024 04:1073,03561,744,94325,022,0002,001,0002,514,944
9Feb 22, 2024 04:1073,33854,643,64025,125,0002,010,0002,273,280
10Feb 22, 2024 04:1076,791101,015,11228,412,78802,248,704
11Feb 22, 2024 04:1076,92494,702,44228,461,89902,293,760
12Feb 22, 2024 04:1077,22689,527,74728,573,63302,252,800