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 01:27Huy Duc LeHuy Duc LeScore: 105,503Success
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 01:2798,259868,264,523805,726,67002,174,976
2Feb 17, 2024 01:27105,503933,929,213865,122,19502,236,416
3Feb 17, 2024 01:27107,335943,253,838880,146,82602,301,952