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 listSep 19, 2026 17:50Andrew EpsteinAndrew EpsteinScore: 2,732Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 17:512,72231,124,83321,268,0001,056,00020,480
2Sep 19, 2026 17:512,72231,103,95721,281,0001,041,00020,480
3Sep 19, 2026 17:512,72931,152,19721,303,0001,079,00020,480
4Sep 19, 2026 17:512,73231,162,07821,341,0001,069,00020,480
5Sep 19, 2026 17:512,73231,194,90921,365,0001,040,00020,480
6Sep 19, 2026 17:512,73831,273,70121,403,0001,056,00020,480
7Sep 19, 2026 17:5124,152206,817,814196,982,0001,070,00020,480
8Sep 19, 2026 17:5124,165206,888,395197,140,0001,015,00020,480
9Sep 19, 2026 17:5124,284209,023,719198,099,0001,036,00020,480