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 22:43Victor MerckléVictor MerckléScore: 71,697Success
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 22:4371,42135,464,47725,142,0001,284,0002,117,632stderr
2Jun 24, 2026 22:4371,53535,593,11125,212,0001,256,0002,117,632stderr
3Jun 24, 2026 22:4371,54335,565,27425,210,0001,261,0002,117,632stderr
4Jun 24, 2026 22:4371,57035,622,47225,221,0001,260,0002,117,632stderr
5Jun 24, 2026 22:4371,69736,178,53625,506,0001,022,0002,117,632stderr
6Jun 24, 2026 22:4371,81035,690,02025,293,0001,277,0002,117,632stderr
7Jun 24, 2026 22:4371,90535,745,28925,320,0001,285,0002,117,632stderr
8Jun 24, 2026 22:4371,99435,783,64925,615,0001,023,0002,117,632stderr
9Jun 24, 2026 22:4372,28935,845,22625,727,0001,020,0002,117,632stderr