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 10, 2026 05:54olliecrowolliecrowScore: 12,048Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 05:5412,041127,193,75397,740,000997,0002,457,600
2Mar 10, 2026 05:5412,048132,995,87095,799,0002,993,0002,457,600
3Mar 10, 2026 05:5412,048124,150,85195,799,0002,993,0002,469,888