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 12, 2026 22:02IlyaIlyaScore: 58,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 22:0358,41031,254,69220,513,0001,099,0002,113,536
2Jul 12, 2026 22:0358,45931,290,70120,446,0001,184,0002,113,536
3Jul 12, 2026 22:0358,47231,283,14220,440,0001,195,0002,113,536
4Jul 12, 2026 22:0358,50831,297,09320,426,0001,222,0002,113,536
5Jul 12, 2026 22:0358,53231,342,17320,480,0001,177,0002,113,536
6Jul 12, 2026 22:0358,71332,047,84520,500,0001,224,0002,113,536
7Jul 12, 2026 22:0358,71831,981,33620,526,0001,200,0002,113,536
8Jul 12, 2026 22:0358,83532,392,55220,542,0001,227,0002,113,536
9Jul 12, 2026 22:0358,88632,377,28420,572,0001,216,0002,113,536