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 10:13Huy Duc LeHuy Duc LeScore: 64,025Success
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 10:1361,539566,608,005504,619,80002,297,856
2Feb 20, 2024 10:1364,025577,806,332525,002,13202,306,048
3Feb 20, 2024 10:1364,810594,188,287531,441,43402,289,664