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 listSep 21, 2025 09:07CemaCemaScore: 84,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2025 09:0783,96556,615,26829,063,0002,004,0002,269,184
2Sep 21, 2025 09:0784,48653,438,29530,252,0001,008,0002,285,568
3Sep 21, 2025 09:0786,04657,608,28629,848,0001,989,0002,265,088