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 listAug 4, 2021 13:06Mikhail ShirokovMikhail ShirokovScore: 21,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2021 13:0621,132237,424,602173,282,12202,260,992
2Aug 4, 2021 13:0621,276244,575,522174,461,48802,265,088
3Aug 4, 2021 13:0621,577240,571,024176,927,69802,260,992