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 22, 2026 01:54Victor MerckléVictor MerckléScore: 6,503Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 01:543,36236,383,74126,507,0001,067,0002,113,536
2Jun 22, 2026 01:543,37835,207,28426,653,0001,050,0002,113,536
3Jun 22, 2026 01:543,43835,679,25327,168,0001,031,0002,113,536
4Jun 22, 2026 01:543,46136,022,20527,319,0001,067,0002,113,536
5Jun 22, 2026 01:546,50360,844,94152,311,0001,016,0002,113,536
6Jun 22, 2026 01:546,55061,230,12552,700,0001,017,0002,113,536
7Jun 22, 2026 01:5412,761112,185,984102,498,0002,143,0002,113,536
8Jun 22, 2026 01:5412,782112,306,607102,628,0002,188,0002,113,536
9Jun 22, 2026 01:5412,915113,551,398103,884,0002,027,0002,113,536