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 28, 2026 23:45Dominique GarmierDominique GarmierScore: 388,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 23:45387,651166,187,425142,428,0001,003,0002,457,600
2Mar 28, 2026 23:45388,768170,743,517141,847,0001,997,0002,338,816
3Mar 28, 2026 23:45388,930174,583,425141,906,0001,998,0002,355,200