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 16, 2026 16:18olliecrowolliecrowScore: 555,357Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 16:18553,143234,963,83426,955,000177,708,0002,367,488
2Apr 16, 2026 16:18555,357231,617,06927,929,000177,553,0002,375,680
3Apr 16, 2026 16:18571,795241,970,02327,942,000183,622,0002,363,392