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 listSep 20, 2026 14:57Andrew EpsteinAndrew EpsteinScore: 1,847,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2026 14:581,840,710691,686,838679,038,0002,025,0002,117,632stderr
2Sep 20, 2026 14:581,842,172692,048,041680,601,0001,003,0002,117,632stderr
3Sep 20, 2026 14:581,843,540692,665,886680,049,0002,061,0002,117,632stderr
4Sep 20, 2026 14:581,846,237693,581,633682,105,0001,003,0002,117,632stderr
5Sep 20, 2026 14:581,847,670694,109,605682,630,0001,008,0002,117,632stderr
6Sep 20, 2026 14:581,847,797694,058,427682,681,0001,004,0002,117,632stderr
7Sep 20, 2026 14:581,852,891696,804,632683,562,0002,008,0002,117,632stderr
8Sep 20, 2026 14:581,853,372696,157,467684,745,0001,003,0002,117,632stderr
9Sep 20, 2026 14:581,854,459696,541,775685,147,0001,003,0002,117,632stderr