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 13:36Huy Duc LeHuy Duc LeScore: 34,183Success
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 13:3631,390324,138,849257,399,82202,187,264
2Feb 20, 2024 13:3634,183345,307,599280,296,50402,297,856
3Feb 20, 2024 13:3634,276350,601,039281,066,19702,240,512