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 24, 2026 23:31Dominique GarmierDominique GarmierScore: 70,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 23:3170,32750,678,55024,020,0002,001,0002,359,296
2Mar 24, 2026 23:3170,43848,903,10225,060,0001,002,0002,281,472
3Mar 24, 2026 23:3170,50550,517,42625,084,0001,003,0002,281,472