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 17:52Victor MerckléVictor MerckléScore: 133,464Success
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 17:53132,84558,418,72948,114,0001,039,0002,113,536
2Jun 24, 2026 17:53133,28958,503,56548,255,0001,062,0002,113,536
3Jun 24, 2026 17:53133,36258,489,17648,277,0001,067,0002,113,536
4Jun 24, 2026 17:53133,45458,481,47248,311,0001,067,0002,113,536
5Jun 24, 2026 17:53133,46458,486,44948,323,0001,059,0002,113,536
6Jun 24, 2026 17:53133,47558,542,65348,327,0001,059,0002,113,536
7Jun 24, 2026 17:53133,57558,531,36548,364,0001,059,0002,113,536
8Jun 24, 2026 17:53133,70258,622,64848,431,0001,039,0002,113,536
9Jun 24, 2026 17:53133,90058,644,37848,515,0001,028,0002,113,536