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 21, 2025 14:10thatmagicalcatthatmagicalcatScore: 142,716Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2025 14:10142,18178,498,90951,596,0001,011,0002,367,488
2Jun 21, 2025 14:10142,70879,720,74250,810,0001,992,0002,465,792
3Jun 21, 2025 14:10142,71685,096,55150,813,0001,992,0002,277,376
4Jun 21, 2025 14:10142,71686,023,51550,813,0001,992,0002,359,296
5Jun 21, 2025 14:10142,79581,231,55551,838,000996,0002,359,296
6Jun 21, 2025 14:10143,02481,120,27049,924,0002,995,0002,359,296