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 listApr 22, 2025 20:50Steve BronderSteve BronderScore: 70,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2025 20:5070,91645,910,52225,230,0001,009,0002,514,944
2Apr 22, 2025 20:5070,95947,709,59425,246,0001,009,0002,539,520
3Apr 22, 2025 20:5071,22253,104,39225,339,0001,013,0002,433,024