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 10, 2026 15:35Victor MerckléVictor MerckléScore: 64,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 15:3664,16231,319,66723,740,00002,113,536
2Jun 10, 2026 15:3664,19431,232,95723,752,00002,113,536
3Jun 10, 2026 15:3664,31631,354,35723,797,00002,113,536
4Jun 10, 2026 15:3664,54031,390,12723,880,00002,113,536
5Jun 10, 2026 15:3664,74331,449,37523,955,00002,113,536
6Jun 10, 2026 15:3664,78931,483,00823,972,00002,113,536
7Jun 10, 2026 15:3664,95631,559,27124,034,00002,113,536
8Jun 10, 2026 15:3665,01031,724,65324,054,00002,113,536
9Jun 10, 2026 15:3665,37531,597,77824,189,00002,113,536