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 12:28Dominique GarmierDominique GarmierScore: 70,832Success
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 12:2870,63549,324,59625,130,0001,005,0002,355,200
2Mar 30, 2026 12:2870,83253,306,76324,192,0002,016,0002,367,488
3Mar 30, 2026 12:2870,93049,823,51824,226,0002,018,0002,367,488