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 19:54Yuriy 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 19:5400000Error: No answer to stdout. Died or killed?stderr
2Jul 16, 2023 19:546,395617,778,59852,439,94102,220,032
3Jul 16, 2023 19:546,417622,369,11752,619,21402,281,472
4Jul 16, 2023 19:546,501617,293,26953,305,04902,285,568