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:28IlyaIlyaScore: 22,302,905Success
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:3022,134,2438,199,212,3168,015,750,000173,920,0002,113,536
2Jun 24, 2026 23:3022,223,3168,232,459,8928,058,763,000163,864,0002,113,536
3Jun 24, 2026 23:3022,282,1818,254,027,2668,076,586,000167,821,0002,113,536
4Jun 24, 2026 23:3022,301,8168,261,573,8618,078,652,000173,020,0002,113,536
5Jun 24, 2026 23:3022,302,9058,261,511,1598,080,414,000171,661,0002,113,536
6Jun 24, 2026 23:3022,330,2818,272,124,6728,095,505,000166,699,0002,113,536
7Jun 24, 2026 23:3022,356,4108,282,289,4678,102,724,000169,148,0002,113,536
8Jun 24, 2026 23:3022,360,9008,283,428,9568,101,553,000171,980,0002,113,536
9Jun 24, 2026 23:3022,402,0278,298,673,4388,116,581,000172,169,0002,113,536