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 20, 2026 16:51olliecrowolliecrowScore: 261,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 16:51260,208122,227,86993,269,0003,008,0002,338,816
2Mar 20, 2026 16:51261,557126,563,57294,781,0001,995,0002,338,816
3Mar 20, 2026 16:51261,659124,612,33295,816,000998,0002,338,816