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 listMar 15, 2026 11:13Dominique GarmierDominique GarmierScore: 163,600Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 11:13162,69285,849,68358,190,0002,006,0002,396,160
2Mar 15, 2026 11:13162,99283,033,72758,297,0002,010,0002,400,256
3Mar 15, 2026 11:13163,10881,265,81460,350,00002,273,280
4Mar 15, 2026 11:13163,50082,300,64959,487,0001,008,0002,396,160
5Mar 15, 2026 11:13163,60085,657,43159,524,0001,008,0002,400,256
6Mar 15, 2026 11:13163,98988,095,36059,665,0001,011,0002,404,352
7Mar 15, 2026 11:13164,40386,113,68258,835,0001,994,0002,400,256
8Mar 15, 2026 11:13164,42788,492,72560,838,00002,396,160
9Mar 15, 2026 11:13166,16285,263,19960,473,0001,007,0002,273,280