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 03:11Huy Duc LeHuy Duc LeScore: 84,422Success
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 03:1183,45957,641,82628,888,0001,992,0002,510,848
2Feb 22, 2024 03:1183,93558,506,54330,055,0001,001,0002,277,376
3Feb 22, 2024 03:1184,04156,652,10329,089,0002,006,0002,519,040
4Feb 22, 2024 03:1184,18155,278,63429,138,0002,009,0002,510,848
5Feb 22, 2024 03:1184,21961,366,63030,156,0001,005,0002,277,376
6Feb 22, 2024 03:1184,23057,028,89629,155,0002,010,0002,510,848
7Feb 22, 2024 03:1184,42254,417,27728,214,0003,022,0002,277,376
8Feb 22, 2024 03:1184,49758,241,50030,256,0001,008,0002,277,376
9Feb 22, 2024 03:1184,76555,145,52331,363,00002,277,376
10Feb 22, 2024 03:1187,70093,673,76932,448,92802,248,704
11Feb 22, 2024 03:1188,09089,538,61532,593,12902,236,416
12Feb 22, 2024 03:1188,259117,547,39032,655,88802,252,800