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 25, 2026 11:03Victor MerckléVictor MerckléScore: 58,491Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 11:0458,24529,074,10720,534,0001,017,0002,113,536
2Jun 25, 2026 11:0458,26729,089,12720,536,0001,023,0002,113,536
3Jun 25, 2026 11:0458,34029,013,37320,583,0001,003,0002,113,536
4Jun 25, 2026 11:0458,38929,113,19820,576,0001,028,0002,113,536
5Jun 25, 2026 11:0458,49129,239,99220,611,0001,031,0002,113,536
6Jun 25, 2026 11:0458,52929,103,99620,624,0001,032,0002,113,536
7Jun 25, 2026 11:0458,53729,495,04320,657,0001,002,0002,113,536
8Jun 25, 2026 11:0458,56729,563,07520,537,0001,133,0002,113,536
9Jun 25, 2026 11:04145,82461,397,49552,912,0001,043,0002,113,536