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 03:42Victor MerckléVictor MerckléScore: 97,716Success
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 03:4397,62143,538,71736,120,00002,117,632stderr
2Jun 25, 2026 03:4397,64044,154,79435,087,0001,040,0002,117,632stderr
3Jun 25, 2026 03:4397,64543,803,82835,126,0001,003,0002,117,632stderr
4Jun 25, 2026 03:4397,70543,867,65336,151,00002,117,632stderr
5Jun 25, 2026 03:4397,71643,844,74036,155,00002,117,632stderr
6Jun 25, 2026 03:4397,90243,743,34935,170,0001,054,0002,117,632stderr
7Jun 25, 2026 03:4397,95443,899,75936,243,00002,117,632stderr
8Jun 25, 2026 03:4397,98144,280,34835,232,0001,021,0002,117,632stderr
9Jun 25, 2026 03:4397,99143,966,70935,246,0001,011,0002,117,632stderr