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 14, 2026 21:52Elijah KinElijah KinScore: 77,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 21:5277,158657,336,665435,793,000196,906,0002,310,144
2Mar 14, 2026 21:5277,741660,601,448440,636,000196,837,0002,314,240
3Mar 14, 2026 21:5278,054673,146,529443,029,000197,013,0002,306,048