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 04:08Steve BronderSteve BronderScore: 63,246Success
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 04:0862,66543,146,17021,170,0002,016,0002,433,024
2Jul 15, 2025 04:0863,24649,526,82323,401,00002,539,520
3Jul 15, 2025 04:0863,38942,134,10322,435,0001,019,0002,433,024