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 25, 2026 06:14limanjun99limanjun99Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 06:14063,086,46842,616,0002,029,000380,928No answer to stdout. Died or killed?
2Apr 25, 2026 06:1434,130296,419,234276,870,0002,998,0002,539,520
3Apr 25, 2026 06:1435,385306,439,406288,162,0002,001,0002,535,424