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 listFeb 11, 2026 12:08Alex KentAlex KentScore: 21,302,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 12:0821,238,2357,898,647,7547,711,257,000146,890,0002,281,472
2Feb 11, 2026 12:0821,241,0547,892,387,5817,713,298,000145,892,0002,281,472
3Feb 11, 2026 12:0821,262,5847,901,288,3467,721,265,000145,891,0002,281,472
4Feb 11, 2026 12:0821,284,5387,902,980,0797,728,386,000146,893,0002,310,144
5Feb 11, 2026 12:0821,302,1357,916,934,2407,729,910,000151,880,0002,506,752
6Feb 11, 2026 12:0821,370,5847,940,728,8077,757,228,000149,888,0002,281,472
7Feb 11, 2026 12:0821,435,3787,971,090,5577,779,185,000151,905,0002,281,472
8Feb 11, 2026 12:0821,510,6307,996,708,6407,812,027,000146,906,0002,281,472
9Feb 11, 2026 12:0821,528,9437,998,195,1627,813,810,000151,899,0002,281,472