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 listJan 6, 2026 16:37Rajarshi BasuRajarshi BasuScore: 83,680Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 6, 2026 16:3781,495699,233,734541,399,000126,859,0002,498,560
2Jan 6, 2026 16:3783,680711,751,161564,320,000121,853,0002,281,472
3Jan 6, 2026 16:37116,759988,589,867833,499,000123,925,0002,281,472