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 listMar 27, 2024 23:14emily graceemily graceScore: 87,382Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2024 23:1471,734643,788,435588,217,30202,297,856
2Mar 27, 2024 23:1487,382798,922,962716,536,18602,256,896
3Mar 27, 2024 23:1498,975876,096,987811,597,76402,174,976