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:00Matthew SillsMatthew SillsScore: 72,573Success
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:0071,77651,261,60725,536,0001,021,0002,289,664
2Jul 28, 2024 19:0071,77652,423,85625,536,0001,021,0002,289,664
3Jul 28, 2024 19:0071,89555,433,38525,578,0001,023,0002,523,136
4Jul 28, 2024 19:0072,01652,468,57425,622,0001,024,0002,289,664
5Jul 28, 2024 19:0072,07651,856,63725,643,0001,025,0002,289,664
6Jul 28, 2024 19:0072,14952,632,07426,695,00002,289,664
7Jul 28, 2024 19:0072,57355,390,57424,863,0001,989,0002,289,664
8Jul 28, 2024 19:0072,57653,342,48424,864,0001,989,0002,265,088
9Jul 28, 2024 19:0072,59251,368,08424,870,0001,989,0002,289,664
10Jul 28, 2024 19:0074,94899,296,36427,730,73802,273,280
11Jul 28, 2024 19:0075,25587,333,93927,844,21902,260,992
12Jul 28, 2024 19:0075,576104,622,78027,962,98202,269,184