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 31, 2021 22:56Mikhail ShirokovMikhail ShirokovScore: 140,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 31, 2021 22:56130,3361,137,788,1931,068,751,12302,281,472
2Jul 31, 2021 22:56140,3281,220,480,7441,150,687,85402,281,472
3Jul 31, 2021 22:56142,4401,219,074,0661,168,010,97902,220,032