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 07:14e1011e1011Error
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 07:1501,071,713,0241,055,955,0004,456,00020,480expected "429496513963 ", got "Ascending: 50.001% Descending: 49.999% Equal: 0.000% Longest ascending run: 11 Longest descending run: 11 Quarter 1 mean: 2053133349.817 Quarter 2 mean: 2288886907.149 Quarter 3 mean: 2221606262.889 Quarter 4 mean:...
2Oct 20, 2026 07:1501,072,537,6841,055,491,0005,586,00020,480expected "429496529558 ", got "Ascending: 50.001% Descending: 49.999% Equal: 0.000% Longest ascending run: 11 Longest descending run: 11 Quarter 1 mean: 2158432283.425 Quarter 2 mean: 2054359094.836 Quarter 3 mean: 2120294147.343 Quarter 4 mean:...
3Oct 20, 2026 07:1501,069,093,8061,056,639,0001,005,00020,480expected "429496517286 ", got "Ascending: 50.003% Descending: 49.997% Equal: 0.000% Longest ascending run: 11 Longest descending run: 12 Quarter 1 mean: 2108123327.258 Quarter 2 mean: 2251510223.363 Quarter 3 mean: 2299763070.446 Quarter 4 mean:...