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 19, 2026 02:56olliecrowolliecrowScore: 164,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 02:56163,14390,087,75559,357,0001,006,0002,277,376
2Apr 19, 2026 02:56164,74681,344,24559,957,000999,0002,400,256
3Apr 19, 2026 02:56165,00386,785,83959,050,0002,001,0002,400,256