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 listMay 12, 2026 00:17Victor MerckléVictor MerckléScore: 64,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 00:1864,31832,459,31922,788,0001,010,0002,113,536
2May 12, 2026 00:1864,52932,865,44022,826,0001,050,0002,113,536
3May 12, 2026 00:1864,59733,282,35022,802,0001,099,0002,113,536
4May 12, 2026 00:1864,63735,050,73622,816,0001,100,0002,113,536
5May 12, 2026 00:1864,70232,773,73822,857,0001,083,0002,113,536
6May 12, 2026 00:1864,81335,046,86722,883,0001,098,0002,113,536
7May 12, 2026 00:1865,06232,887,37922,969,0001,104,0002,113,536
8May 12, 2026 00:1865,13234,483,76123,006,0001,093,0002,113,536
9May 12, 2026 00:1865,80534,671,77523,197,0001,151,0002,113,536