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 listSep 3, 2023 23:46Mikhail ShirokovMikhail ShirokovScore: 1,379,836Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2023 23:461,368,88111,279,053,40011,224,824,80202,256,896
2Sep 3, 2023 23:461,379,83611,380,950,25411,314,656,24202,265,088
3Sep 3, 2023 23:461,399,34111,534,898,01511,474,596,42402,265,088