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 14, 2025 00:06Steve BronderSteve BronderScore: 115,924Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2025 00:06115,89566,931,54041,884,000997,0002,539,520
2Jul 14, 2025 00:06115,92467,052,04341,895,000997,0002,539,520
3Jul 14, 2025 00:06116,05762,472,73440,944,0001,997,0002,433,024