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 16:38gchebanovgchebanovScore: 5,586Success
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 16:385,505105,054,04445,139,70502,256,896
2Jul 13, 2023 16:385,586104,123,24745,805,23802,273,280
3Jul 13, 2023 16:385,599106,611,82445,908,82602,203,648