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 26, 2025 19:30Aniruddha DebAniruddha DebScore: 70,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2025 19:3070,30347,634,29725,012,0001,000,0002,535,424
2Mar 26, 2025 19:3070,57049,829,83824,103,0002,008,0002,506,752
3Mar 26, 2025 19:3070,64152,698,03725,132,0001,005,0002,535,424