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 listJul 28, 2024 18:28Matthew SillsMatthew SillsScore: 98,557Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2024 18:2897,23261,920,63932,978,0002,998,0002,269,184
2Jul 28, 2024 18:2897,56859,004,05135,098,0001,002,0002,273,280
3Jul 28, 2024 18:2897,61459,181,15835,114,0001,003,0002,289,664
4Jul 28, 2024 18:2897,85160,034,03034,194,0002,011,0002,289,664
5Jul 28, 2024 18:2897,89258,106,75034,208,0002,012,0002,371,584
6Jul 28, 2024 18:2897,99258,730,87434,243,0002,014,0002,289,664
7Jul 28, 2024 18:2898,55761,023,78935,454,0001,012,0002,269,184
8Jul 28, 2024 18:2898,60358,697,24735,470,0001,013,0002,289,664
9Jul 28, 2024 18:2898,91462,287,65535,609,000989,0002,387,968
10Jul 28, 2024 18:2899,30199,242,19036,741,31602,273,280
11Jul 28, 2024 18:2899,770107,263,02536,915,01702,269,184
12Jul 28, 2024 18:28100,03898,161,05737,014,13802,256,896