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 2, 2026 23:32Karthik ReddyKarthik ReddyScore: 5,181Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 23:342,7946,032,117,98121,888,0001,023,00020,480
2Oct 2, 2026 23:342,8706,032,875,91522,468,0001,070,00020,480
3Oct 2, 2026 23:343,1546,035,129,06524,841,0001,025,00020,480
4Oct 2, 2026 23:345,1446,051,355,37641,166,0001,019,00020,480
5Oct 2, 2026 23:345,1816,051,833,23141,417,0001,072,00020,480
6Oct 2, 2026 23:345,2116,051,991,37741,698,0001,039,00020,480
7Oct 2, 2026 23:345,2146,052,066,65741,731,0001,027,00020,480
8Oct 2, 2026 23:345,2206,052,168,52541,649,0001,162,00020,480
9Oct 2, 2026 23:345,2626,052,515,07742,130,0001,024,00020,480