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 27, 2026 13:23Victor MerckléVictor MerckléScore: 12,103Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 13:243,12133,310,99824,409,0001,185,0002,113,536
2Jun 27, 2026 13:243,14533,473,85124,722,0001,073,0002,113,536
3Jun 27, 2026 13:243,14533,538,84524,719,0001,075,0002,113,536
4Jun 27, 2026 13:243,18234,126,69024,930,0001,164,0002,113,536
5Jun 27, 2026 13:2412,103107,091,74598,240,0001,009,0002,113,536
6Jun 27, 2026 13:2412,104107,485,98498,245,0001,009,0002,113,536
7Jun 27, 2026 13:2412,124107,131,86298,410,0001,009,0002,113,536
8Jun 27, 2026 13:2412,132107,411,79698,479,0001,009,0002,113,536
9Jun 27, 2026 13:2412,935113,847,958105,065,0001,007,0002,113,536