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 17:51IlyaIlyaScore: 62,502Success
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 17:5362,15932,488,48421,888,0001,111,0002,113,536
2Jun 30, 2026 17:5362,29432,464,94921,940,0001,109,0002,113,536
3Jun 30, 2026 17:5362,37832,574,00421,976,0001,104,0002,113,536
4Jun 30, 2026 17:5362,49433,032,21821,997,0001,126,0002,113,536
5Jun 30, 2026 17:5362,50232,653,49221,948,0001,178,0002,113,536
6Jun 30, 2026 17:5362,53533,059,61221,920,0001,218,0002,113,536
7Jun 30, 2026 17:5362,65433,197,14421,951,0001,231,0002,113,536
8Jun 30, 2026 17:5363,01641,554,20222,093,0001,223,0002,113,536
9Jun 30, 2026 17:5363,46441,544,56922,244,0001,238,0002,113,536