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 listOct 5, 2024 08:34Alexis EngelkeAlexis EngelkeScore: 243,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2024 08:34242,432123,804,24138,870,00050,830,0002,514,944
2Oct 5, 2024 08:34243,527115,350,77235,041,00055,064,0002,510,848
3Oct 5, 2024 08:34243,576117,188,01539,053,00051,070,0002,514,944
4Oct 5, 2024 08:34243,843113,284,65739,096,00051,126,0002,285,568
5Oct 5, 2024 08:34243,932113,309,55135,099,00055,156,0002,514,944
6Oct 5, 2024 08:34245,132119,416,64738,871,00051,828,0002,285,568
7Oct 5, 2024 08:34247,076123,986,62839,179,00052,239,0002,285,568
8Oct 5, 2024 08:34248,995119,678,22639,054,00053,074,0002,510,848
9Oct 5, 2024 08:34249,022116,345,75736,054,00056,084,0002,514,944