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 21, 2026 19:35Dominique GarmierDominique GarmierScore: 2,522,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 19:352,470,668943,248,540912,149,0001,998,0002,535,424
2Mar 21, 2026 19:352,522,959957,102,310930,497,0002,998,0002,330,624
3Mar 21, 2026 19:352,661,1431,005,745,752983,624,000999,0002,519,040