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 26, 2026 06:32IlyaIlyaScore: 21,681,318Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 06:3521,584,4437,995,878,7947,819,843,000166,401,0002,113,536
2Jun 26, 2026 06:3521,604,7328,003,597,6427,827,234,000166,517,0002,113,536
3Jun 26, 2026 06:3521,615,7438,007,328,1007,826,604,000171,221,0002,113,536
4Jun 26, 2026 06:3521,624,9868,011,345,2467,832,669,000168,576,0002,113,536
5Jun 26, 2026 06:3521,681,3188,031,718,3317,853,724,000168,364,0002,113,536
6Jun 26, 2026 06:3521,691,9708,035,486,1247,855,420,000170,609,0002,113,536
7Jun 26, 2026 06:3521,729,0648,049,485,8997,871,806,000167,948,0002,113,536
8Jun 26, 2026 06:3521,733,8488,051,841,4637,869,730,000171,794,0002,113,536
9Jun 26, 2026 06:3521,794,5568,073,617,2837,892,733,000171,253,0002,113,536