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 1, 2026 10:54Victor MerckléVictor MerckléScore: 2,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 10:552,69830,589,39721,010,0001,114,0002,117,632stderr
2Sep 1, 2026 10:552,71330,723,98621,232,0001,016,0002,117,632stderr
3Sep 1, 2026 10:552,72630,525,76121,213,0001,142,0002,117,632stderr
4Sep 1, 2026 10:552,72830,510,41621,341,0001,036,0002,117,632stderr
5Sep 1, 2026 10:552,73730,619,60521,346,0001,098,0002,117,632stderr
6Sep 1, 2026 10:552,74230,627,46821,375,0001,111,0002,117,632stderr
7Sep 1, 2026 10:552,74530,682,85021,423,0001,090,0002,117,632stderr
8Sep 1, 2026 10:555,40252,687,25643,288,0001,016,0002,117,632stderr
9Sep 1, 2026 10:555,40653,397,95543,314,0001,020,0002,117,632stderr