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 listJun 30, 2026 22:39IlyaIlyaScore: 60,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 22:4060,02931,595,93121,082,0001,129,0002,113,536
2Jun 30, 2026 22:4060,11831,747,63021,039,0001,205,0002,113,536
3Jun 30, 2026 22:4060,12131,696,30521,131,0001,114,0002,113,536
4Jun 30, 2026 22:4060,12932,214,23321,053,0001,195,0002,113,536
5Jun 30, 2026 22:4060,13732,951,48221,081,0001,170,0002,113,536
6Jun 30, 2026 22:4060,17831,759,77721,164,0001,102,0002,113,536
7Jun 30, 2026 22:4060,30031,935,02621,112,0001,199,0002,113,536
8Jun 30, 2026 22:4060,45132,279,63621,166,0001,201,0002,113,536
9Jun 30, 2026 22:4060,56432,375,92421,178,0001,231,0002,113,536