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 28, 2023 23:40Mikhail ShirokovMikhail ShirokovScore: 21,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2023 23:4021,582245,270,114176,971,88502,260,992
2Aug 28, 2023 23:4021,621252,440,717177,292,92702,265,088
3Aug 28, 2023 23:4021,986244,664,388180,284,76102,269,184