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 listMay 1, 2026 14:15Pavel SkripkinPavel SkripkinScore: 54,986Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 14:1653,434456,059,578303,115,000135,051,0002,494,464
2May 1, 2026 14:1653,935460,834,088306,190,000136,084,0002,473,984
3May 1, 2026 14:1654,138457,965,007303,954,000139,979,0002,514,944
4May 1, 2026 14:1654,773463,768,960312,797,000136,347,0002,461,696
5May 1, 2026 14:1654,986474,398,436315,923,000134,967,0002,469,888
6May 1, 2026 14:1655,045474,207,953308,574,000142,803,0002,473,984
7May 1, 2026 14:1655,259471,818,899311,403,000141,728,0002,469,888
8May 1, 2026 14:1655,434470,705,100319,691,000134,869,0002,469,888
9May 1, 2026 14:1655,627471,343,152322,105,000134,043,0002,482,176