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 listAug 29, 2026 11:52Victor MerckléVictor MerckléScore: 5,361Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 11:532,75530,919,15121,584,0001,015,0002,117,632stderr
2Aug 29, 2026 11:532,75530,928,89621,576,0001,021,0002,117,632stderr
3Aug 29, 2026 11:532,75930,996,25421,585,0001,044,0002,117,632stderr
4Aug 29, 2026 11:532,94639,455,31523,141,0001,022,0002,117,632stderr
5Aug 29, 2026 11:535,36152,361,73042,909,0001,054,0002,117,632stderr
6Aug 29, 2026 11:535,39252,416,78443,067,0001,151,0002,117,632stderr
7Aug 29, 2026 11:535,39252,645,84943,079,0001,140,0002,117,632stderr
8Aug 29, 2026 11:535,87666,354,72147,174,0001,016,0002,117,632stderr
9Aug 29, 2026 11:535,93864,435,63447,478,0001,214,0002,117,632stderr