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 25, 2026 15:25Zhou180Zhou180Score: 25,305Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 15:2524,911213,497,414199,477,0004,797,0002,117,632
2Jun 25, 2026 15:2525,305216,651,161202,948,0004,558,0002,117,632
3Jun 25, 2026 15:2525,409217,521,197204,322,0004,034,0002,117,632