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 listJul 13, 2023 05:11Paul MasurelPaul MasurelScore: 26,328Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2023 05:1126,034293,783,592213,474,86802,244,608
2Jul 13, 2023 05:1126,255278,027,705215,294,24502,256,896
3Jul 13, 2023 05:1126,267274,901,266215,385,45602,314,240
4Jul 13, 2023 05:1126,328272,142,443215,892,63902,306,048
5Jul 13, 2023 05:1126,384271,909,347216,350,13902,207,744
6Jul 13, 2023 05:1126,414282,302,240216,592,99802,228,224