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 listMar 22, 2026 21:17olliecrowolliecrowScore: 119,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 21:18118,45472,218,74942,832,000996,0002,310,144
2Mar 22, 2026 21:18118,89570,294,13141,992,0001,999,0002,293,760
3Mar 21, 2026 16:23118,95169,413,93342,012,0002,000,0002,314,240
4Mar 21, 2026 16:22118,99768,144,70243,029,0001,000,0002,547,712
5Mar 21, 2026 16:23119,05972,019,57943,051,0001,001,0002,293,760
6Mar 22, 2026 21:18119,06570,374,17141,051,0003,003,0002,404,352
7Mar 21, 2026 16:23119,10570,606,29942,066,0002,003,0002,306,048
8Mar 22, 2026 21:17119,33074,854,89841,142,0003,010,0002,297,856
9Mar 21, 2026 16:22119,78675,898,21643,314,0001,007,0002,289,664
10Mar 22, 2026 21:17120,10067,385,06743,428,0001,009,0002,297,856
11Mar 21, 2026 16:22121,88675,644,10644,096,0001,002,0002,289,664
12Mar 22, 2026 21:17123,49788,555,01643,708,0001,986,0002,322,432