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 15, 2026 20:48Elijah KinElijah KinScore: 203,732Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 20:48203,165101,278,66539,089,00036,082,0002,318,336
2Mar 15, 2026 20:48203,73297,919,60533,168,00042,213,0002,260,992
3Mar 15, 2026 20:48204,392105,854,19230,250,00045,375,0002,256,896