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 listAug 23, 2024 20:27TuetuopayTuetuopayScore: 448,656Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2024 20:27446,7733,726,594,3913,663,541,38402,236,416
2Aug 23, 2024 20:27448,6563,740,024,0113,678,979,93902,256,896
3Aug 23, 2024 20:27448,8573,745,811,8593,680,623,58802,240,512