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 21:47olliecrowolliecrowScore: 167,149Success
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 21:47166,89793,929,65660,740,0001,012,0002,334,720
2Apr 16, 2026 21:47167,14991,735,37459,850,0001,995,0002,318,336
3Apr 16, 2026 21:47167,39586,371,55858,940,0002,996,0002,306,048