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 15:11olliecrowolliecrowScore: 12,162Success
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 15:1112,133127,470,12098,485,0001,004,0002,420,736
2Mar 4, 2026 15:1112,162125,544,24997,734,0001,994,0002,441,216
3Mar 4, 2026 15:1112,168129,568,66197,785,0001,995,0002,416,640