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:06Victor MerckléVictor MerckléScore: 70,429Success
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:0670,21835,146,28824,963,0001,018,0002,117,632stderr
2Jun 25, 2026 00:0670,22735,121,57124,971,0001,013,0002,117,632stderr
3Jun 25, 2026 00:0670,27835,111,79724,984,0001,019,0002,117,632stderr
4Jun 25, 2026 00:0670,32935,192,13025,010,0001,012,0002,117,632stderr
5Jun 25, 2026 00:0670,42935,159,04125,039,0001,020,0002,117,632stderr
6Jun 25, 2026 00:0670,50035,233,73225,063,0001,022,0002,117,632stderr
7Jun 25, 2026 00:0670,70035,260,31425,017,0001,142,0002,117,632stderr
8Jun 25, 2026 00:0670,82435,267,07825,188,0001,017,0002,117,632stderr
9Jun 25, 2026 00:0670,87535,332,36325,191,0001,033,0002,117,632stderr