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 00:58Victor MerckléVictor MerckléScore: 97,170Success
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 00:5997,03243,882,94834,886,0001,016,0002,117,632stderr
2Jun 25, 2026 00:5997,09143,574,76135,924,00002,117,632stderr
3Jun 25, 2026 00:5997,10043,910,14034,888,0001,039,0002,117,632stderr
4Jun 25, 2026 00:5997,16743,622,93834,946,0001,006,0002,117,632stderr
5Jun 25, 2026 00:5997,17045,559,74334,913,0001,040,0002,117,632stderr
6Jun 25, 2026 00:5997,20844,882,22234,958,0001,009,0002,117,632stderr
7Jun 25, 2026 00:5997,43544,090,83635,020,0001,031,0002,117,632stderr
8Jun 25, 2026 00:5997,44043,928,96935,026,0001,027,0002,117,632stderr
9Jun 25, 2026 00:5997,47044,141,25335,026,0001,038,0002,117,632stderr