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:21Huy Duc LeHuy Duc LeScore: 72,732Success
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:2172,42253,355,50521,834,0004,962,0002,273,280
2Feb 22, 2024 07:2172,56558,108,96223,866,0002,983,0002,510,848
3Feb 22, 2024 07:2172,58155,191,85124,866,0001,989,0002,273,280
4Feb 22, 2024 07:2172,58458,881,63923,872,0002,984,0002,273,280
5Feb 22, 2024 07:2172,68653,126,00024,902,0001,992,0002,510,848
6Feb 22, 2024 07:2172,73055,908,53023,920,0002,990,0002,273,280
7Feb 22, 2024 07:2172,73256,623,48124,918,0001,993,0002,514,944
8Feb 22, 2024 07:2172,74355,545,63224,922,0001,993,0002,273,280
9Feb 22, 2024 07:2172,80862,534,51923,946,0002,993,0002,273,280
10Feb 22, 2024 07:2176,647104,112,37128,359,34902,256,896
11Feb 22, 2024 07:2177,01295,281,13228,494,31002,248,704
12Feb 22, 2024 07:2177,08391,719,43728,520,76302,256,896