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 16, 2026 22:13izotoffizotoffScore: 280,084Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 22:13269,932123,307,35897,878,0001,997,0002,314,240
2Mar 16, 2026 22:13280,084131,362,905102,625,0001,006,0002,314,240
3Mar 16, 2026 22:13291,543137,067,770105,874,0001,997,0002,314,240