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 16, 2023 22:22Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 22:2300000Error: No answer to stdout. Died or killed?stderr
2Jul 16, 2023 22:225,159610,247,32442,307,61802,301,952
3Jul 16, 2023 22:225,177596,337,86542,451,77302,244,608
4Jul 16, 2023 22:225,279613,511,23543,285,79302,256,896