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 10, 2026 13:37Pavel SkripkinPavel SkripkinScore: 24,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 13:384,16544,361,39530,861,0003,293,0002,117,632
2May 10, 2026 13:384,21043,499,21331,255,0003,275,0002,117,632
3May 10, 2026 13:384,21044,096,65130,493,0004,033,0002,117,632
4May 10, 2026 13:3823,975206,283,716192,592,0004,011,0002,117,632
5May 10, 2026 13:3824,464208,239,361197,525,0003,086,0002,117,632
6May 10, 2026 13:3824,841211,009,493199,626,0004,072,0002,117,632
7May 10, 2026 13:3825,110216,691,343202,766,0003,138,0002,117,632
8May 10, 2026 13:3825,521217,538,037205,223,0004,052,0002,117,632
9May 10, 2026 13:3825,798219,211,262208,267,0003,279,0002,117,632