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 listSep 2, 2026 11:22C#_userC#_userError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 11:2301,032,349,826871,849,000147,657,0002,150,400expected "2058973996 ", got "2451006512 "
2Sep 2, 2026 11:230856,780,629698,976,000147,922,0002,150,400expected "2287148922 ", got "758368917 "
3Sep 2, 2026 11:230972,509,083807,452,000155,254,0002,150,400expected "2165958017 ", got "2998737838 "