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:10emily graceemily graceScore: 122,077Success
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:1098,714889,138,911809,457,42002,240,512
2Mar 27, 2024 23:10122,0771,058,126,7881,001,029,44502,301,952
3Mar 27, 2024 23:10137,6231,189,066,1191,128,509,94202,301,952