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 listJul 13, 2023 13:05gchebanovgchebanovScore: 9,242Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2023 13:059,121146,960,11174,793,77002,203,648
2Jul 13, 2023 13:059,242139,883,20075,781,33102,191,360
3Jul 13, 2023 13:059,323141,868,24476,452,41802,252,800