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 listJun 15, 2025 12:05Steve BronderSteve BronderScore: 69,273Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2025 12:0668,85946,566,93025,478,00002,437,120
2Jun 15, 2025 12:0568,97852,677,70324,502,0001,020,0002,433,024
3Jun 15, 2025 12:0669,22252,857,20925,612,00002,539,520
4Jun 15, 2025 12:0569,27355,614,33125,631,00002,539,520
5Jun 15, 2025 12:0569,43054,140,81025,689,00002,277,376
6Jun 15, 2025 12:0669,84953,892,24524,850,000994,0002,539,520