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 listMay 24, 2024 18:58CemaCemaScore: 93,981Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2024 18:5892,87659,281,73032,343,0002,021,0002,281,472
2May 24, 2024 18:5892,92257,589,54933,370,0001,011,0002,281,472
3May 24, 2024 18:5892,97358,098,77233,389,0001,011,0002,510,848
4May 24, 2024 18:5893,42456,940,74833,551,0001,016,0002,281,472
5May 24, 2024 18:5893,60562,403,18434,634,00002,502,656
6May 24, 2024 18:5893,73261,271,48933,661,0001,020,0002,519,040
7May 24, 2024 18:5893,98160,964,12432,786,0001,987,0002,281,472
8May 24, 2024 18:5894,14362,786,93631,848,0002,985,0002,281,472
9May 24, 2024 18:5894,87061,044,96033,097,0002,005,0002,510,848
10May 24, 2024 18:5897,25794,463,62135,985,10502,244,608
11May 24, 2024 18:5897,36796,937,37736,025,84202,224,128
12May 24, 2024 18:5897,644104,054,88636,128,22302,244,608