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 listJul 3, 2026 08:43IlyaIlyaScore: 61,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 08:4661,43232,744,70321,519,0001,211,0002,113,536
2Jul 3, 2026 08:4661,63232,758,05821,591,0001,213,0002,113,536
3Jul 3, 2026 08:4661,64532,360,19121,686,0001,123,0002,113,536
4Jul 3, 2026 08:4661,64832,241,64621,613,0001,197,0002,113,536
5Jul 3, 2026 08:4661,65432,295,21421,611,0001,201,0002,113,536
6Jul 3, 2026 08:4661,68132,789,64221,579,0001,243,0002,113,536
7Jul 3, 2026 08:4661,74332,361,83221,758,0001,087,0002,113,536
8Jul 3, 2026 08:4661,95932,874,58821,718,0001,207,0002,113,536
9Jul 3, 2026 08:4661,97232,741,70921,729,0001,201,0002,113,536