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 listMar 12, 2026 04:30olliecrowolliecrowScore: 60,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 04:3060,39545,086,84622,346,00002,404,352
2Mar 12, 2026 04:2160,51143,034,18022,389,00002,404,352
3Mar 12, 2026 04:2160,57644,562,39322,413,00002,400,256
4Mar 12, 2026 04:3060,60842,054,42521,406,0001,019,0002,273,280
5Mar 12, 2026 04:3060,64348,618,54221,419,0001,019,0002,400,256
6Mar 12, 2026 04:2160,73242,382,06122,471,00002,273,280