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 listOct 9, 2026 08:16Karthik ReddyKarthik ReddyScore: 2,542Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 09:122,53529,710,22220,790,000020,480
2Oct 9, 2026 09:122,53629,556,17720,797,000020,480
3Oct 9, 2026 09:122,53829,770,05120,813,000020,480
4Oct 9, 2026 09:122,53929,733,25420,826,000020,480
5Oct 9, 2026 09:122,54229,752,23120,848,000020,480
6Oct 9, 2026 09:122,54329,701,85920,859,000020,480
7Oct 9, 2026 09:122,54929,841,57020,905,000020,480
8Oct 9, 2026 09:122,54929,777,95020,909,000020,480
9Oct 9, 2026 09:122,54930,422,76520,904,000020,480