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:04Huy Duc LeHuy Duc LeScore: 61,230Success
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:0457,679532,158,735472,966,40502,297,856
2Feb 20, 2024 10:0461,230560,915,003502,089,45202,265,088
3Feb 20, 2024 10:04142,9551,238,503,8631,172,230,29402,191,360