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 24, 2026 18:37Victor MerckléVictor MerckléScore: 212,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 18:38211,02787,312,86730,960,00047,120,0002,113,536
2Jun 24, 2026 18:38212,08387,566,78231,371,00047,100,0002,113,536
3Jun 24, 2026 18:38212,47587,787,56130,909,00047,707,0002,113,536
4Jun 24, 2026 18:38212,62487,943,70931,421,00047,250,0002,113,536
5Jun 24, 2026 18:38212,96287,979,95431,675,00047,121,0002,113,536
6Jun 24, 2026 18:38213,12188,240,65130,848,00048,007,0002,113,536
7Jun 24, 2026 18:38214,17588,367,45531,292,00047,953,0002,113,536
8Jun 24, 2026 18:38214,38188,425,07930,983,00048,338,0002,113,536
9Jun 24, 2026 18:38214,54588,580,95130,878,00048,504,0002,113,536