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 4, 2026 05:38olliecrowolliecrowScore: 12,165Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 05:3812,163127,163,70496,745,0002,992,0002,437,120
2Mar 4, 2026 05:3812,165128,649,74496,762,0002,992,0002,420,736
3Mar 4, 2026 05:3812,188131,774,83696,945,0002,998,0002,408,448