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 listMay 4, 2026 23:25olliecrowolliecrowScore: 77,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 23:2672,61051,991,86625,812,0001,054,0002,506,752
2May 4, 2026 23:2673,61342,713,54125,184,0002,053,0002,531,328
3May 4, 2026 23:2675,95144,271,85626,862,0001,240,0002,322,432
4May 4, 2026 23:2677,05654,033,71627,456,0001,055,0002,506,752
5May 4, 2026 23:2677,51045,577,97927,438,0001,241,0002,514,944
6May 4, 2026 23:2678,29452,490,66727,913,0001,056,0002,510,848
7May 4, 2026 23:2679,40252,566,32028,165,0001,214,0002,510,848
8May 4, 2026 23:2684,96246,790,97929,290,0002,146,0002,506,752
9May 4, 2026 23:2686,44567,711,25028,778,0003,207,0002,318,336