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 3, 2026 04:38Josu San MartinJosu San MartinScore: 3,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 04:393,88241,881,52829,445,0002,392,0002,113,536
2Sep 3, 2026 04:393,89242,719,29329,576,0002,340,0002,113,536
3Sep 3, 2026 04:393,90041,959,77029,588,0002,396,0002,113,536
4Sep 3, 2026 04:393,90942,365,62329,708,0002,349,0002,113,536
5Sep 3, 2026 04:393,92244,225,60230,100,0002,067,0002,113,536
6Sep 3, 2026 04:3910,35295,667,57278,505,0006,384,0002,113,536
7Sep 3, 2026 04:3910,44895,721,80279,012,0006,669,0002,113,536
8Sep 3, 2026 04:3911,814106,886,81590,678,0006,204,0002,113,536
9Sep 3, 2026 04:3920,209175,875,853159,186,0006,531,0002,117,632