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 listJul 15, 2025 05:19Steve BronderSteve BronderScore: 65,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2025 05:1965,26241,871,17023,141,0001,006,0002,433,024
2Jul 15, 2025 05:1965,74345,819,90824,325,00002,539,520
3Jul 15, 2025 05:1965,76248,533,39724,332,00002,277,376