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 14, 2026 19:40Victor MerckléVictor MerckléScore: 2,974Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 19:412,90931,865,01722,745,0001,113,0002,117,632stderr
2Jul 14, 2026 19:412,91632,000,81422,851,0001,061,0002,117,632stderr
3Jul 14, 2026 19:412,92231,976,29322,955,0001,009,0002,117,632stderr
4Jul 14, 2026 19:412,95332,299,17423,202,0001,017,0002,117,632stderr
5Jul 14, 2026 19:412,97432,439,92923,360,0001,027,0002,117,632stderr
6Jul 14, 2026 19:413,15834,367,92924,741,0001,158,0002,117,632stderr
7Jul 14, 2026 19:4111,661103,653,04494,596,0001,028,0002,117,632stderr
8Jul 14, 2026 19:4111,690103,897,15294,720,0001,139,0002,117,632stderr
9Jul 14, 2026 19:4111,767104,547,77895,362,0001,135,0002,117,632stderr