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 11:19IlyaIlyaScore: 61,264Success
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 11:2160,88632,010,65021,423,0001,105,0002,113,536
2Jun 30, 2026 11:2161,05933,364,85021,412,0001,180,0002,113,536
3Jun 30, 2026 11:2161,17032,045,92821,456,0001,177,0002,113,536
4Jun 30, 2026 11:2161,20032,108,01621,548,0001,096,0002,113,536
5Jun 30, 2026 11:2161,26432,567,96121,463,0001,205,0002,113,536
6Jun 30, 2026 11:2161,28632,645,43921,480,0001,196,0002,113,536
7Jun 30, 2026 11:2161,37832,659,71421,512,0001,198,0002,113,536
8Jun 30, 2026 11:2161,41832,669,85021,536,0001,189,0002,113,536
9Jun 30, 2026 11:2161,50232,646,15221,568,0001,188,0002,113,536