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 21, 2026 15:51olliecrowolliecrowScore: 85,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 15:5184,31652,910,25730,191,0001,006,0002,392,064
2Mar 21, 2026 15:5185,17051,140,39831,513,00002,392,064
3Mar 21, 2026 15:5185,53865,177,97631,649,00002,383,872