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:09Victor MerckléVictor MerckléScore: 57,145Success
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:1056,92728,674,78920,049,0001,014,0002,113,536
2Jun 25, 2026 11:1056,98928,548,49020,050,0001,036,0002,113,536
3Jun 25, 2026 11:1057,01028,569,49320,072,0001,022,0002,113,536
4Jun 25, 2026 11:1057,10228,590,89020,113,0001,015,0002,113,536
5Jun 25, 2026 11:1057,14528,948,25520,106,0001,038,0002,113,536
6Jun 25, 2026 11:1057,15428,621,66620,141,0001,006,0002,113,536
7Jun 25, 2026 11:1057,16429,190,57720,118,0001,033,0002,113,536
8Jun 25, 2026 11:1057,17828,820,04020,140,0001,016,0002,113,536
9Jun 25, 2026 11:1057,23728,703,72520,176,0001,002,0002,113,536