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 05:45Rajarshi BasuRajarshi BasuScore: 89,957Success
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 05:4581,070689,661,305541,814,000122,957,0002,400,256
2Jan 2, 2026 05:4589,957770,341,810615,708,000121,942,0002,281,472
3Jan 2, 2026 05:45102,972874,914,886732,454,000111,916,0002,273,280