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 listJan 2, 2026 08:06Rajarshi BasuRajarshi BasuScore: 85,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 08:064,49862,713,83832,896,0003,987,0002,383,872
2Jan 2, 2026 08:0685,624729,822,814588,258,000113,856,0002,453,504
3Jan 2, 2026 08:06105,819895,737,446748,753,000118,960,0002,490,368