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 28, 2024 16:45emily graceemily graceScore: 104,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2024 16:3683,933756,811,523688,249,02602,174,976
2Mar 28, 2024 16:4594,483838,818,740774,759,70502,174,976
3Mar 28, 2024 16:3695,414859,321,208782,397,82002,297,856
4Mar 28, 2024 16:45104,791919,618,630859,289,80102,277,376
5Mar 28, 2024 16:45113,088987,067,719927,318,30402,301,952
6Mar 28, 2024 16:36113,505997,037,997930,738,63202,293,760