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 listSep 28, 2023 14:26apuxbtapuxbtScore: 68,031Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 14:2663,774585,445,365522,950,52902,265,088
2Sep 28, 2023 14:2668,031615,234,981557,851,46102,256,896
3Sep 28, 2023 14:2668,726627,202,318563,550,19702,265,088