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 20, 2026 08:49e1011e1011Score: 167,418Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 08:50157,71369,226,91457,169,0001,185,0002,113,536
2Oct 20, 2026 08:50158,17069,486,46057,252,0001,271,0002,113,536
3Oct 20, 2026 08:50158,76469,597,85657,473,0001,270,0002,113,536
4Oct 20, 2026 08:50167,03273,279,67657,500,0004,302,0002,113,536
5Oct 20, 2026 08:50167,41872,876,23857,359,0004,586,0002,113,536
6Oct 20, 2026 08:50174,55176,098,92763,562,0001,022,0002,113,536
7Oct 20, 2026 08:50174,58976,034,82563,589,0001,009,0002,113,536
8Oct 20, 2026 08:50174,68375,849,91363,605,0001,028,0002,113,536
9Oct 20, 2026 08:50191,77592,718,13063,917,0007,040,0002,113,536