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 3, 2026 01:49Karthik ReddyKarthik ReddyScore: 2,494Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2026 01:502,48429,430,12720,371,000020,480
2Oct 3, 2026 01:502,48729,539,51220,398,000020,480
3Oct 3, 2026 01:502,49030,019,74820,419,000020,480
4Oct 3, 2026 01:502,49229,459,95720,439,000020,480
5Oct 3, 2026 01:502,49429,432,19220,454,000020,480
6Oct 3, 2026 01:502,49529,485,70120,459,000020,480
7Oct 3, 2026 01:502,49529,450,25020,460,000020,480
8Oct 3, 2026 01:502,50029,578,11220,506,000020,480
9Oct 3, 2026 01:502,51330,166,01019,565,0001,042,00020,480