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 listJun 23, 2026 20:39Victor MerckléVictor MerckléScore: 63,235Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 20:4062,36230,511,68223,074,00002,113,536
2Jun 23, 2026 20:4062,93730,706,36823,287,00002,113,536
3Jun 23, 2026 20:4062,95930,742,50023,295,00002,113,536
4Jun 23, 2026 20:4063,02930,742,00623,321,00002,113,536
5Jun 23, 2026 20:4063,23530,817,10623,397,00002,113,536
6Jun 23, 2026 20:4063,31031,390,98823,425,00002,113,536
7Jun 23, 2026 20:4063,70031,073,05223,569,00002,113,536
8Jun 23, 2026 20:4063,90231,438,84123,644,00002,113,536
9Jun 23, 2026 20:4063,94331,478,81923,659,00002,113,536