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:21Huy Duc LeHuy Duc LeScore: 79,884Success
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:2178,73550,507,37426,119,0003,013,0002,281,472
2Feb 22, 2024 03:2179,25951,592,55527,304,0002,022,0002,281,472
3Feb 22, 2024 03:2179,25955,450,34827,304,0002,022,0002,281,472
4Feb 22, 2024 03:2179,44655,264,52627,368,0002,027,0002,494,464
5Feb 22, 2024 03:2179,73552,350,19428,485,0001,017,0002,281,472
6Feb 22, 2024 03:2179,80553,074,43828,510,0001,018,0002,494,464
7Feb 22, 2024 03:2179,88456,105,30028,538,0001,019,0002,281,472
8Feb 22, 2024 03:2180,20357,337,12728,652,0001,023,0002,281,472
9Feb 22, 2024 03:2180,31662,377,35028,693,0001,024,0002,490,368
10Feb 22, 2024 03:2183,275105,187,74730,811,89902,277,376
11Feb 22, 2024 03:2184,13898,322,92231,131,09602,228,224
12Feb 22, 2024 03:2184,527115,354,08931,275,05002,232,320