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:02Huy Duc LeHuy Duc LeScore: 74,343Success
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:0273,71153,469,20225,253,0002,020,0002,519,040
2Feb 22, 2024 07:0274,11149,548,39224,375,0003,046,0002,273,280
3Feb 22, 2024 07:0274,15449,457,46526,421,0001,016,0002,519,040
4Feb 22, 2024 07:0274,16551,206,46726,425,0001,016,0002,510,848
5Feb 22, 2024 07:0274,18153,853,17127,447,00002,514,944
6Feb 22, 2024 07:0274,22455,413,47826,446,0001,017,0002,510,848
7Feb 22, 2024 07:0274,34350,280,21325,470,0002,037,0002,277,376
8Feb 22, 2024 07:0274,46549,827,12926,532,0001,020,0002,273,280
9Feb 22, 2024 07:0274,53554,457,36025,536,0002,042,0002,510,848
10Feb 22, 2024 07:0278,103107,597,22628,898,19602,248,704
11Feb 22, 2024 07:0278,26994,182,75828,959,52902,256,896
12Feb 22, 2024 07:0278,95799,580,78529,213,96402,248,704