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 20, 2026 03:15olliecrowolliecrowScore: 18,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 03:1518,322178,899,734148,240,0002,003,0002,502,656
2Mar 20, 2026 03:1518,420175,296,682146,043,0005,001,0002,400,256
3Mar 20, 2026 03:1518,468178,187,484150,435,0001,002,0002,412,544