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 19:13Matthew SillsMatthew SillsScore: 72,808Success
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 19:1372,48459,328,77025,826,000993,0002,289,664
2Jul 28, 2024 19:1372,57051,741,66225,857,000994,0002,289,664
3Jul 28, 2024 19:1372,57353,401,54925,858,000994,0002,269,184
4Jul 28, 2024 19:1372,59753,994,36324,872,0001,989,0002,289,664
5Jul 28, 2024 19:1372,62251,188,29524,880,0001,990,0002,273,280
6Jul 28, 2024 19:1372,69551,401,53824,905,0001,992,0002,523,136
7Jul 28, 2024 19:1372,80849,441,59024,944,0001,995,0002,289,664
8Jul 28, 2024 19:1372,90349,708,27224,976,0001,998,0002,277,376
9Jul 28, 2024 19:1373,18648,628,23725,074,0002,005,0002,289,664
10Jul 28, 2024 19:1375,41794,372,78827,904,28802,277,376
11Jul 28, 2024 19:1375,826101,841,52528,055,60002,252,800
12Jul 28, 2024 19:1376,21197,896,29028,198,07902,273,280