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 15:17Yuriy LyfenkoYuriy LyfenkoScore: 5,398Success
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 15:175,198599,814,41142,623,04702,195,456
2Jul 16, 2023 18:355,301603,976,36943,469,70702,314,240
3Jul 16, 2023 15:175,357617,980,06443,923,71002,285,568
4Jul 16, 2023 15:175,398619,067,60744,261,19202,207,744
5Jul 16, 2023 18:355,571613,584,99045,681,67402,301,952
6Jul 16, 2023 18:355,602596,437,36845,934,05702,273,280