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 29, 2026 19:27IlyaIlyaScore: 60,272Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 19:2859,89131,687,98521,052,0001,108,0002,113,536
2Jun 29, 2026 19:2860,03231,631,74121,088,0001,124,0002,113,536
3Jun 29, 2026 19:2860,20831,759,90921,169,0001,108,0002,113,536
4Jun 29, 2026 19:2860,21332,158,81621,085,0001,194,0002,113,536
5Jun 29, 2026 19:2860,27232,129,01421,109,0001,192,0002,113,536
6Jun 29, 2026 19:2860,31632,243,11721,115,0001,202,0002,113,536
7Jun 29, 2026 19:2860,32731,832,57321,162,0001,159,0002,113,536
8Jun 29, 2026 19:2860,38932,226,59521,119,0001,225,0002,113,536
9Jun 29, 2026 19:2860,52431,883,96321,202,0001,192,0002,113,536