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 listJan 23, 2025 01:29Ian MckibbenIan MckibbenScore: 69,919Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 01:2969,44655,685,24024,668,0001,027,0002,531,328
2Jan 23, 2025 01:2969,82753,980,29724,843,000993,0002,428,928
3Jan 23, 2025 01:2969,83855,654,30825,840,00002,531,328
4Jan 23, 2025 01:2969,85155,546,02725,845,00002,531,328
5Jan 23, 2025 01:2969,91950,348,47624,875,000995,0002,531,328
6Jan 23, 2025 01:2969,92452,332,43323,882,0001,990,0002,531,328
7Jan 23, 2025 01:2970,08448,184,15024,934,000997,0002,437,120
8Jan 23, 2025 01:2970,08951,551,72123,939,0001,994,0002,424,832
9Jan 23, 2025 01:2970,17646,094,12024,967,000998,0002,428,928