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:11e1011e1011Score: 95,654Success
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:1283,07241,679,48129,641,0001,096,0002,113,536
2Oct 20, 2026 08:1294,10845,700,11433,713,0001,107,0002,113,536
3Oct 20, 2026 08:1294,52946,086,03533,775,0001,201,0002,113,536
4Oct 20, 2026 08:1295,01846,564,52933,959,0001,198,0002,113,536
5Oct 20, 2026 08:1295,65446,400,38834,176,0001,216,0002,113,536
6Oct 20, 2026 08:1295,77546,473,83834,231,0001,206,0002,113,536
7Oct 20, 2026 08:1295,83746,978,02534,236,0001,224,0002,113,536
8Oct 20, 2026 08:1296,25657,634,38734,597,0001,018,0002,113,536
9Oct 20, 2026 08:1296,47060,025,13034,441,0001,253,0002,113,536