Median Sergey Svistunov

Find the median of 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 median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listJul 6, 2025 08:02Aniruddha DebAniruddha DebScore: 9,006Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2025 08:028,59391,931,98968,452,0002,013,0002,285,568
2Jul 6, 2025 08:028,820103,032,96268,306,0004,018,0002,281,472
3Jul 6, 2025 08:028,877102,504,97769,798,0002,991,0002,281,472
4Jul 6, 2025 08:028,892104,086,61368,923,0003,995,0002,367,488
5Jul 6, 2025 08:029,00699,968,06670,853,0002,993,0002,383,872
6Jul 6, 2025 08:029,04896,874,55470,184,0004,010,0002,498,560
7Jul 6, 2025 08:029,49499,991,48772,860,0004,990,0002,400,256
8Jul 6, 2025 08:029,940108,973,65974,462,0007,043,0002,428,928
9Jul 6, 2025 08:0210,145109,613,94582,189,0001,002,0002,416,640