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 listOct 2, 2026 21:34Karthik ReddyKarthik ReddyScore: 53,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 21:3453,6186,028,943,51119,839,000020,480
2Oct 2, 2026 21:3453,6216,029,010,75819,840,000020,480
3Oct 2, 2026 21:3453,8646,029,125,35019,930,000020,480