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 listJul 9, 2026 17:54Victor MerckléVictor MerckléScore: 11,759Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 17:553,01932,760,40423,742,0001,021,0002,117,632stderr
2Jul 9, 2026 17:5511,735104,262,88695,071,0001,158,0002,117,632stderr
3Jul 9, 2026 17:5511,750104,792,87595,222,0001,129,0002,117,632stderr
4Jul 9, 2026 17:5511,753104,766,07295,218,0001,159,0002,117,632stderr
5Jul 9, 2026 17:5511,759104,381,16895,298,0001,129,0002,117,632stderr
6Jul 9, 2026 17:5511,783104,622,76995,620,0001,006,0002,117,632stderr
7Jul 9, 2026 17:5511,912105,704,99096,547,0001,134,0002,117,632stderr
8Jul 9, 2026 17:5511,932105,848,19396,662,0001,184,0002,117,632stderr
9Jul 9, 2026 17:5512,025107,007,98297,465,0001,147,0002,117,632stderr