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 22, 2026 23:51izotoffizotoffScore: 30,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 23:5130,234270,850,709245,923,0001,999,0002,326,528
2Mar 22, 2026 23:5130,240275,639,316243,970,0003,999,0002,326,528
3Mar 22, 2026 23:5131,064280,589,029253,726,000998,0002,330,624