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 15:25Andrew EpsteinAndrew EpsteinScore: 29,779Success
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 15:2629,502252,356,504239,908,0002,009,0002,117,632stderr
2Sep 19, 2026 15:2629,513253,074,054238,995,0003,012,0002,117,632stderr
3Sep 19, 2026 15:2629,580253,660,032239,543,0003,016,0002,117,632stderr
4Sep 19, 2026 15:2629,685253,918,550240,295,0003,126,0002,117,632stderr
5Sep 19, 2026 15:2629,779255,534,816241,089,0003,105,0002,117,632stderr
6Sep 19, 2026 15:2629,850255,815,117241,769,0003,007,0002,117,632stderr
7Sep 19, 2026 15:2629,906256,409,147242,039,0003,198,0002,117,632stderr
8Sep 19, 2026 15:2630,134257,494,936243,924,0003,176,0002,117,632stderr
9Sep 19, 2026 15:2630,564261,675,167247,619,0003,011,0002,117,632stderr