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 24, 2024 08:31DanielDanielScore: 118,492Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2024 08:3198,467109,728,10936,432,91602,207,744
2Jul 24, 2024 08:3198,614109,765,17036,487,30802,207,744
3Jul 24, 2024 08:3199,284106,105,38936,734,99102,203,648
4Jul 24, 2024 08:31118,01668,295,28342,651,0001,015,0002,359,296
5Jul 24, 2024 08:31118,15772,662,54642,702,0001,016,0002,281,472
6Jul 24, 2024 08:31118,48668,454,86541,848,0001,992,0002,367,488
7Jul 24, 2024 08:31118,49271,922,71342,846,000996,0002,351,104
8Jul 24, 2024 08:31118,57374,564,21942,875,000997,0002,351,104
9Jul 24, 2024 08:31118,70873,368,52041,926,0001,996,0002,281,472
10Jul 24, 2024 08:31118,79275,432,23341,956,0001,997,0002,281,472
11Jul 24, 2024 08:31119,20369,775,35542,101,0002,004,0002,281,472
12Jul 24, 2024 08:31119,29568,870,41542,133,0002,006,0002,371,584