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 listOct 13, 2021 10:16Mikhail ShirokovMikhail ShirokovScore: 21,699Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2021 10:1620,593230,786,195168,862,05402,248,704
2Oct 13, 2021 10:1621,699250,638,464177,928,73102,273,280
3Oct 13, 2021 10:1622,019256,875,054180,554,56402,248,704