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 04:04Huy Duc LeHuy Duc LeScore: 72,659Success
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 04:0472,51157,734,23525,836,000993,0002,510,848
2Feb 22, 2024 04:0472,55751,455,12524,858,0001,988,0002,519,040
3Feb 22, 2024 04:0472,55953,116,74323,864,0002,983,0002,506,752
4Feb 22, 2024 04:0472,58956,170,43123,874,0002,984,0002,523,136
5Feb 22, 2024 04:0472,60356,212,70524,874,0001,989,0002,273,280
6Feb 22, 2024 04:0472,62456,522,96824,804,0002,067,0002,273,280
7Feb 22, 2024 04:0472,65956,117,60724,893,0001,991,0002,273,280
8Feb 22, 2024 04:0472,85152,722,95424,959,0001,996,0002,277,376
9Feb 22, 2024 04:0472,87652,169,43323,968,0002,996,0002,277,376
10Feb 22, 2024 04:0476,789109,712,93628,411,81902,240,512
11Feb 22, 2024 04:0477,10995,719,32828,530,31302,224,128
12Feb 22, 2024 04:0477,28693,069,91728,595,71102,252,800