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 listFeb 10, 2026 14:34MMisMMisScore: 593,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 14:34587,681246,214,14934,910,000182,532,0002,502,656
2Feb 10, 2026 14:34593,635248,090,81436,940,000182,705,0002,510,848
3Feb 10, 2026 14:34599,886244,509,66534,993,000186,965,0002,453,504