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 listMay 5, 2026 06:25olliecrowolliecrowScore: 3,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 06:333,27741,943,23725,601,0001,274,0002,314,240
2May 5, 2026 06:333,28742,424,55725,889,0001,068,0002,293,760
3May 5, 2026 06:333,28844,869,45225,916,0001,049,0002,539,520
4May 5, 2026 06:333,29344,390,66225,967,0001,042,0002,330,624
5May 5, 2026 06:333,29747,870,12525,992,0001,050,0002,523,136
6May 5, 2026 06:3323,598210,258,087191,188,0002,319,0002,527,232
7May 5, 2026 06:3323,668213,550,883191,886,0002,198,0002,301,952
8May 5, 2026 06:3323,690210,186,157192,168,0002,097,0002,514,944
9May 5, 2026 06:3323,770212,980,103192,850,0002,067,0002,461,696