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 8, 2026 12:33Victor MerckléVictor MerckléScore: 2,898Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 12:342,86031,500,12522,346,0001,111,0002,117,632stderr
2Jul 8, 2026 12:342,87231,686,39822,525,0001,031,0002,117,632stderr
3Jul 8, 2026 12:342,87732,234,21822,571,0001,022,0002,117,632stderr
4Jul 8, 2026 12:342,88831,789,87722,672,0001,015,0002,117,632stderr
5Jul 8, 2026 12:342,89831,790,51822,754,0001,016,0002,117,632stderr
6Jul 8, 2026 12:3411,744104,322,67795,181,0001,122,0002,117,632stderr
7Jul 8, 2026 12:3411,749104,318,84395,288,0001,055,0002,117,632stderr
8Jul 8, 2026 12:3411,845105,173,94595,995,0001,137,0002,117,632stderr
9Jul 8, 2026 12:3427,565234,040,389224,011,0002,027,0002,117,632stderr