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 31, 2021 10:19Ilya AniskovetsIlya AniskovetsScore: 33,238Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2021 10:1932,091329,350,385263,147,82602,244,608
2Oct 31, 2021 10:1933,238338,083,452272,552,80502,248,704
3Oct 31, 2021 10:1934,182335,385,781280,292,80402,248,704