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 30, 2026 07:45Dominique GarmierDominique GarmierScore: 76,673Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 07:4576,18151,267,00225,167,0003,020,0002,326,528
2Mar 30, 2026 07:4576,67355,694,81827,356,0001,013,0002,482,176
3Mar 30, 2026 07:4576,97855,828,06127,465,0001,017,0002,453,504