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 01:51izotoffizotoffScore: 82,357Success
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 01:5178,35158,953,96526,991,0001,999,0002,310,144
2Mar 22, 2026 01:5182,35754,188,05425,394,0005,078,0002,396,160
3Mar 22, 2026 01:5185,48162,581,07028,568,0003,060,0002,301,952