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 listJun 22, 2025 21:30Adam FolwarcznyAdam FolwarcznyScore: 57,687Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 21:3054,298474,397,807444,241,0001,000,0002,412,544
2Jun 22, 2025 21:3055,926485,214,825457,591,000999,0002,281,472
3Jun 22, 2025 21:3057,505502,016,177468,546,0002,997,0002,404,352
4Jun 22, 2025 21:3057,628494,555,821470,551,0001,998,0002,281,472
5Jun 22, 2025 21:3057,687499,841,610471,033,0002,000,0002,281,472
6Jun 22, 2025 21:3058,251503,673,769475,658,0001,998,0002,281,472
7Jun 22, 2025 21:3058,998506,164,075481,783,0001,999,0002,478,080
8Jun 22, 2025 21:3060,149515,257,056492,223,0001,000,0002,281,472
9Jun 22, 2025 21:3060,544522,504,789494,464,0001,997,0002,281,472