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 10:49IlyaIlyaScore: 60,962Success
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 10:5060,60531,908,76521,328,0001,096,0002,113,536
2Jun 30, 2026 10:5060,69131,931,99121,344,0001,112,0002,113,536
3Jun 30, 2026 10:5060,74331,960,39121,369,0001,106,0002,113,536
4Jun 30, 2026 10:5060,91632,166,27221,382,0001,157,0002,113,536
5Jun 30, 2026 10:5060,96232,117,50121,440,0001,116,0002,113,536
6Jun 30, 2026 10:5061,02732,050,73021,462,0001,118,0002,113,536
7Jun 30, 2026 10:5061,13232,541,19421,420,0001,199,0002,113,536
8Jun 30, 2026 10:5061,18132,501,82421,438,0001,199,0002,113,536
9Jun 30, 2026 10:5061,22432,134,74821,532,0001,121,0002,113,536