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 22:35emily graceemily graceScore: 108,573Success
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 22:3577,845699,487,962638,330,32802,301,952
2Mar 27, 2024 22:35108,573958,553,926890,298,13402,297,856
3Mar 27, 2024 22:35109,052962,522,018894,228,50602,301,952