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 listJun 23, 2026 14:17Victor MerckléVictor MerckléScore: 9,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 14:179,41584,811,98675,146,0002,058,0002,117,632stderr
2Jun 23, 2026 14:179,42884,981,96376,302,0001,014,0002,117,632stderr
3Jun 23, 2026 14:179,46685,295,80276,612,0001,013,0002,117,632stderr
4Jun 23, 2026 14:179,47586,509,57675,668,0002,028,0002,117,632stderr
5Jun 23, 2026 14:179,48985,829,13775,790,0002,025,0002,117,632stderr
6Jun 23, 2026 14:179,50685,621,35875,763,0002,187,0002,117,632stderr
7Jun 23, 2026 14:179,61386,482,16276,824,0002,010,0002,117,632stderr
8Jun 23, 2026 14:1718,864162,590,044152,509,0002,178,0002,117,632stderr
9Jun 23, 2026 14:1718,884162,538,635153,845,0001,007,0002,117,632stderr