Swimming at the 2016 Summer Paralympics – Women's 50 metre backstroke S4

The women's 50 metre backstroke S4 event at the 2016 Paralympic Games took place on 16 September 2016, at the Olympic Aquatics Stadium. Two heats were held. The swimmers with the eight fastest times advanced to the final.

Women's 50 metre backstroke S4
at the XV Paralympic Games
VenueOlympic Aquatics Stadium
Dates16 September 2016
Competitors9 from 7 nations
Medalists
Jiao Cheng  China
Yue Deng  China
Maryna Verbova  Ukraine

Heats

Heat 1

10:23 16 September 2016:[1]

Rank Lane Name Nationality Time Notes
14Jiao Cheng China47.68WR Q
25Edenia Garcia Brazil54.59Q
33Nely Miranda Herrera Mexico56.05Q
46Sonja Sigurđardóttir Iceland1:01.65Q

Heat 2

10:27 16 September 2016:[1]

Rank Lane Name Nationality Time Notes
16Mariia Lafina Ukraine51.62Q
23Yue Deng China51.94Q
35Maryna Verbova Ukraine53.38Q
44Arjola Trimi Italy57.09Q
52Karolina Hamer Poland1:03.11

Final

18:30 16 September 2016:[2]

Rank Lane Name Nationality Time Notes
4Jiao Cheng China48.11
3Yue Deng China50.01
6Maryna Verbova Ukraine52.28
47Nely Miranda Herrera Mexico53.42
51Arjola Trimi Italy54.03
65Mariia Lafina Ukraine54.08
72Edenia Garcia Brazil55.50
88Sonja Sigurdardottir Iceland59.97

Notes

  1. "Women's 50m Backstroke - S4 - Final". Rio 2016 Paralympic Games. Retrieved 7 October 2016.
  2. "Women's 50m Backstroke - S4 - Final". Rio 2016 Paralympic Games. Retrieved 7 October 2016.
gollark: C has more low-level stuff you probably don't want to bother with if doing a build script; Python has useful high level features like "working strings".
gollark: I disagree with that, actually.
gollark: It also took something like 10% of the time to write, which is good.
gollark: - unbee python- the osmarkspythonbuildsystem™ functions/variables, to the extent that they exist, constitute an "embedded domain specific language"- Python is more featureful than Dale syntax, however- well, mine does it seminonawfully, if you don't mind its complete lack of job throttling
gollark: Via parser combinators, I can define *exactly* what I want and easily parse it, unless it involves left recursion in which case aææææßæææaæææaaaaæææææææ.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.