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:37Huy Duc LeHuy Duc LeScore: 67,714Success
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:3767,19755,196,24723,869,000994,0002,273,280
2Feb 22, 2024 07:3767,26850,454,91521,903,0002,986,0002,506,752
3Feb 22, 2024 07:3767,35951,670,67522,930,0001,993,0002,514,944
4Feb 22, 2024 07:3767,52256,214,77022,985,0001,998,0002,273,280
5Feb 22, 2024 07:3767,53850,331,44521,991,0002,998,0002,277,376
6Feb 22, 2024 07:3767,55155,973,44220,995,0003,999,0002,506,752
7Feb 22, 2024 07:3767,71448,887,88623,050,0002,004,0002,519,040
8Feb 22, 2024 07:3767,74149,760,68421,054,0004,010,0002,273,280
9Feb 22, 2024 07:3767,88451,988,79423,108,0002,009,0002,273,280
10Feb 22, 2024 07:3771,79686,235,60526,564,36602,256,896
11Feb 22, 2024 07:3771,931102,825,92426,614,31302,236,416
12Feb 22, 2024 07:3772,284101,277,26326,745,20402,195,456