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 14:20Huy Duc LeHuy Duc LeScore: 14,334Success
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 14:2013,697177,150,935112,312,24602,248,704
2Feb 20, 2024 14:2014,334172,156,634117,535,91502,187,264
3Feb 20, 2024 14:2015,923214,204,629130,567,52902,293,760