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 18, 2026 04:48limanjun99limanjun99Score: 119,739Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 04:4896,789825,594,573667,725,000125,948,0002,281,472
2Mar 18, 2026 04:48119,7391,012,367,511850,016,000131,847,0002,297,856
3Mar 18, 2026 04:48127,0231,074,656,341909,767,000131,821,0002,297,856