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:00Victor MerckléVictor MerckléScore: 63,472Success
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:0162,90030,939,27323,273,00002,113,536
2Jun 24, 2026 17:0163,02131,263,01723,318,00002,113,536
3Jun 24, 2026 17:0163,08631,018,95523,342,00002,113,536
4Jun 24, 2026 17:0163,45431,477,10623,478,00002,113,536
5Jun 24, 2026 17:0163,47230,991,04323,485,00002,113,536
6Jun 24, 2026 17:0163,57031,542,68623,521,00002,113,536
7Jun 24, 2026 17:0163,68131,194,21823,562,00002,113,536
8Jun 24, 2026 17:0163,98331,725,18723,674,00002,113,536
9Jun 24, 2026 17:0164,00231,728,64923,681,00002,113,536