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 listNov 4, 2026 21:56e1011e1011Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 21:560127,863,506113,894,0002,014,0002,113,536expected "2130570653 ", got "2130509824 "
2Nov 4, 2026 21:560127,082,027113,633,0002,015,0002,113,536expected "2192882606 ", got "2192834560 "
3Nov 4, 2026 21:560128,860,809114,506,0003,028,0002,113,536expected "2147271448 ", got "2147221504 "