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 12:29Victor MerckléVictor MerckléScore: 63,424Success
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 12:3062,94330,701,50823,289,00002,113,536
2Jun 24, 2026 12:3063,05430,790,98623,330,00002,113,536
3Jun 24, 2026 12:3063,23230,811,96623,396,00002,113,536
4Jun 24, 2026 12:3063,29131,284,46822,418,0001,000,0002,113,536
5Jun 24, 2026 12:3063,42431,482,23823,467,00002,113,536
6Jun 24, 2026 12:3063,52131,008,00423,503,00002,113,536
7Jun 24, 2026 12:3063,52430,948,97923,504,00002,113,536
8Jun 24, 2026 12:3063,53231,542,70223,507,00002,113,536
9Jun 24, 2026 12:3063,86731,108,28523,631,00002,113,536