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:32Yuriy 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:3200000Error: No answer to stdout. Died or killed?stderr
2Jul 16, 2023 22:3400000Error: No answer to stdout. Died or killed?stderr
3Jul 16, 2023 22:3400000Error: No answer to stdout. Died or killed?stderr
4Jul 16, 2023 22:4400000Error: No answer to stdout. Died or killed?stderr
5Jul 16, 2023 22:334,474603,747,35536,690,04702,269,184
6Jul 16, 2023 22:334,498602,947,73136,881,78802,269,184
7Jul 16, 2023 22:334,529592,700,35637,135,24102,256,896