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 08:14Huy Duc LeHuy Duc LeScore: 67,619Success
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 08:1467,14355,474,23221,862,0002,981,0002,273,280
2Feb 22, 2024 08:1467,27649,286,44722,901,0001,991,0002,273,280
3Feb 22, 2024 08:1467,38951,350,94022,940,0001,994,0002,277,376
4Feb 22, 2024 08:1467,43852,042,37722,956,0001,996,0002,506,752
5Feb 22, 2024 08:1467,46853,775,50022,966,0001,997,0002,506,752
6Feb 22, 2024 08:1467,52248,123,84023,984,000999,0002,277,376
7Feb 22, 2024 08:1467,61957,254,48522,017,0003,002,0002,506,752
8Feb 22, 2024 08:1467,68952,977,08123,042,0002,003,0002,506,752
9Feb 22, 2024 08:1467,69253,540,78024,045,0001,001,0002,277,376
10Feb 22, 2024 08:1471,50088,023,37826,454,93502,256,896
11Feb 22, 2024 08:1471,86895,551,82026,591,31902,252,800
12Feb 22, 2024 08:1472,57596,916,94626,852,63402,248,704