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 listFeb 20, 2024 09:45Huy Duc LeHuy Duc LeScore: 128,090Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2024 09:45121,2221,073,484,000994,018,42202,297,856
2Feb 20, 2024 09:45128,0901,109,873,0161,050,340,53002,301,952
3Feb 20, 2024 09:45133,7551,153,308,8671,096,788,64702,289,664