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:36Huy Duc LeHuy Duc LeScore: 69,873Success
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:3669,10050,508,97323,522,0002,045,0002,273,280
2Feb 22, 2024 07:3669,21656,408,24224,586,0001,024,0002,510,848
3Feb 22, 2024 07:3669,49251,424,46024,684,0001,028,0002,273,280
4Feb 22, 2024 07:3669,76255,467,91523,827,0001,985,0002,506,752
5Feb 22, 2024 07:3669,83853,443,17523,853,0001,987,0002,506,752
6Feb 22, 2024 07:3669,87052,022,64823,864,0001,988,0002,273,280
7Feb 22, 2024 07:3669,87351,485,80422,870,0002,983,0002,359,296
8Feb 22, 2024 07:3670,20554,824,65023,978,0001,998,0002,273,280
9Feb 22, 2024 07:3670,31952,492,83923,016,0003,002,0002,506,752
10Feb 22, 2024 07:3673,63690,108,70527,245,24302,240,512
11Feb 22, 2024 07:3674,288108,782,74427,486,54002,252,800
12Feb 22, 2024 07:3674,956119,347,30927,733,79802,248,704