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 listMar 26, 2026 22:07Dominique GarmierDominique GarmierScore: 9,409Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 22:079,400101,040,63874,076,0003,003,0002,367,488
2Mar 26, 2026 22:079,409101,484,73073,146,0004,008,0002,396,160
3Mar 26, 2026 22:079,44899,233,61976,470,0001,006,0002,531,328