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 01:00olliecrowolliecrowScore: 22,225Success
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 01:023,29845,667,68426,011,0001,040,0002,560,000
2May 5, 2026 01:023,30841,651,47126,092,0001,041,0002,551,808
3May 5, 2026 01:023,33045,444,79726,251,0001,060,0002,555,904
4May 5, 2026 01:0222,221199,593,532179,827,0002,390,0002,334,720
5May 5, 2026 01:0222,225197,289,299179,924,0002,322,0002,314,240
6May 5, 2026 01:0222,309199,055,675180,880,0002,059,0002,523,136
7May 5, 2026 01:0222,324200,359,098181,041,0002,016,0002,519,040
8May 5, 2026 01:0222,378200,471,301181,395,0002,112,0002,473,984
9May 5, 2026 01:0222,496200,842,220182,397,0002,071,0002,498,560