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 29, 2024 17:28Drew GarciaDrew GarciaScore: 124,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2024 17:2870,349643,133,009576,863,56302,195,456
2Mar 29, 2024 17:28124,9571,088,525,1681,024,649,86202,273,280
3Mar 29, 2024 17:28150,7031,296,193,3881,235,767,23402,281,472