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 17, 2024 05:08Huy Duc LeHuy Duc LeScore: 110,874Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2024 05:0899,236865,394,475813,737,57402,297,856
2Feb 17, 2024 05:08110,874965,657,475909,167,20302,297,856
3Feb 17, 2024 05:08116,3901,019,414,638954,398,89902,293,760