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 12, 2026 09:50Victor MerckléVictor MerckléScore: 63,978Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 09:5762,85430,818,75823,256,00002,113,536
2Jun 12, 2026 09:5763,57831,096,87923,524,00002,113,536
3Jun 12, 2026 09:5763,63530,999,62023,545,00002,113,536
4Jun 12, 2026 09:5763,77531,393,03023,597,00002,113,536
5Jun 12, 2026 09:5763,97831,225,26823,672,00002,113,536
6Jun 12, 2026 09:5763,98631,173,30623,675,00002,113,536
7Jun 12, 2026 09:5764,04031,268,47723,695,00002,113,536
8Jun 12, 2026 09:5764,21331,375,34023,759,00002,113,536
9Jun 12, 2026 09:5764,30031,372,41022,678,0001,113,0002,113,536