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 24, 2026 23:18IlyaIlyaScore: 22,363,967Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 23:1922,229,2758,235,580,1828,053,708,000171,124,0002,113,536
2Jun 24, 2026 23:1922,363,9678,284,543,1838,102,420,000172,248,0002,113,536
3Jun 24, 2026 23:1922,368,0918,295,126,6958,106,013,000170,181,0002,113,536