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 listJan 28, 2025 08:33mebowlermebowlerScore: 298,027Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2025 08:33294,914135,389,76862,067,00047,051,0002,326,528
2Jan 28, 2025 08:33295,811135,553,96961,252,00048,198,0002,506,752
3Jan 28, 2025 08:33296,138134,965,40765,341,00044,230,0002,514,944
4Jan 28, 2025 08:33296,668142,942,13060,871,00048,896,0002,289,664
5Jan 28, 2025 08:33298,027137,006,68661,150,00049,120,0002,330,624
6Jan 28, 2025 08:33298,097135,454,66757,153,00053,143,0002,527,232
7Jan 28, 2025 08:33298,954142,032,97861,340,00049,273,0002,314,240
8Jan 28, 2025 08:33300,962133,454,33262,199,00049,157,0002,330,624
9Jan 28, 2025 08:33301,246132,942,75359,245,00052,216,0002,375,680