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 12:04Victor MerckléVictor MerckléScore: 3,300Success
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 12:063,19936,149,93524,128,0002,104,0002,138,112
2Jun 27, 2026 12:063,20335,449,24224,192,0002,079,0002,138,112
3Jun 27, 2026 12:063,20536,274,36525,233,0001,051,0002,138,112
4Jun 27, 2026 12:063,24734,416,98425,576,0001,052,0002,138,112
5Jun 27, 2026 12:063,30036,861,22926,015,0001,050,0002,138,112
6Jun 27, 2026 12:063,36937,471,06025,582,0002,046,0002,138,112
7Jun 27, 2026 12:063,67039,051,87927,796,0002,303,0002,138,112
8Jun 27, 2026 12:0612,831114,764,751103,119,0002,097,0002,138,112
9Jun 27, 2026 12:0612,905115,739,127103,696,0002,130,0002,138,112