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:56Huy Duc LeHuy Duc LeScore: 68,149Success
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:5667,77849,470,11723,072,0002,006,0002,273,280
2Feb 22, 2024 07:5667,94359,654,86822,123,0003,016,0002,510,848
3Feb 22, 2024 07:5668,03052,563,70823,158,0002,013,0002,338,816
4Feb 22, 2024 07:5668,03053,974,42923,158,0002,013,0002,510,848
5Feb 22, 2024 07:5668,09552,755,52624,188,0001,007,0002,510,848
6Feb 22, 2024 07:5668,13549,960,84223,194,0002,016,0002,502,656
7Feb 22, 2024 07:5668,14950,171,68624,207,0001,008,0002,273,280
8Feb 22, 2024 07:5668,21948,855,26024,232,0001,009,0002,338,816
9Feb 22, 2024 07:5668,23547,124,94122,218,0003,029,0002,273,280
10Feb 22, 2024 07:5672,47396,763,07526,814,95302,248,704
11Feb 22, 2024 07:5672,95886,864,19926,994,58302,248,704
12Feb 22, 2024 07:5673,010103,999,41927,013,86502,244,608