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 03:58Steve BronderSteve BronderScore: 63,257Success
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 03:5863,01447,085,61723,315,00002,437,120
2Jul 15, 2025 03:5863,25742,798,35823,405,00002,433,024
3Jul 15, 2025 03:5863,55945,675,16022,495,0001,022,0002,539,520