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:19Steve BronderSteve BronderScore: 67,162Success
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:1966,65752,932,86424,663,00002,539,520
2Jul 15, 2025 04:1967,16252,641,97122,862,0001,988,0002,428,928
3Jul 15, 2025 04:1967,48949,774,72623,973,000998,0002,428,928