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 listJun 26, 2026 07:04Zhou180Zhou180Score: 3,917Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 07:053,83940,714,88429,303,0002,180,0002,117,632
2Jun 26, 2026 07:053,87241,296,46729,539,0002,216,0002,117,632
3Jun 26, 2026 07:053,87540,875,07129,633,0002,145,0002,117,632
4Jun 26, 2026 07:053,89040,944,33229,624,0002,281,0002,117,632
5Jun 26, 2026 07:053,91741,715,79529,886,0002,238,0002,117,632
6Jun 26, 2026 07:053,93941,427,05530,044,0002,260,0002,117,632
7Jun 26, 2026 07:053,99741,883,54730,406,0002,373,0002,117,632
8Jun 26, 2026 07:0522,071190,213,059177,902,0003,082,0002,117,632
9Jun 26, 2026 07:0522,080190,188,321177,785,0003,273,0002,117,632