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 listApr 29, 2026 07:27olliecrowolliecrowScore: 25,366Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 07:273,29142,978,42324,989,0001,999,0002,306,048
2Apr 29, 2026 07:273,31244,349,80225,149,0002,011,0002,330,624
3Apr 29, 2026 07:273,31945,873,25024,194,0003,024,0002,478,080
4Apr 29, 2026 07:273,40548,055,82525,929,0001,994,0002,383,872
5Apr 29, 2026 07:2725,366225,065,210205,005,0003,000,0002,514,944
6Apr 29, 2026 07:2725,372226,856,725205,056,0003,000,0002,322,432
7Apr 29, 2026 07:2725,423225,748,619205,469,0003,006,0002,531,328
8Apr 29, 2026 07:2725,474226,042,610203,895,0004,997,0002,555,904
9Apr 29, 2026 07:2725,566230,971,755206,651,0002,994,0002,408,448