Athletics at the 1999 Summer Universiade – Men's 3000 metres steeplechase
The men's 3000 metres steeplechase event at the 1999 Summer Universiade was held at the Estadio Son Moix in Palma de Mallorca, Spain on 9–11 July.[1][2]
Medalists
| Gold | Silver | Bronze |
Giuseppe Maffei |
Khamis Abdullah Saifeldin |
Joël Bourgeois.svg.png){kind=small} |
Results
Heats
| Rank | Heat | Athlete | Nationality | Time | Notes |
|---|---|---|---|---|---|
| 1 | 2 | Khamis Abdullah Saifeldin | | 8:33.48 | Q |
| 2 | 2 | Giuseppe Maffei | | 8:35.01 | Q |
| 3 | 2 | Christian Belz |  | 8:35.62 | Q |
| 4 | 2 | Aziz Driouche |  | 8:35.76 | Q |
| 5 | 2 | José María González |  | 8:35.89 | q |
| 6 | 1 | Joël Bourgeois | | 8:37.59 | Q |
| 7 | 1 | Carlos Suárez | | 8:38.84 | Q |
| 8 | 1 | Iaroslav Muşinschi |  | 8:38.98 | Q |
| 9 | 1 | Frank Bruder |  | 8:39.25 | Q |
| 10 | 1 | Chuck Sloan |  | 8:39.71 | q |
| 11 | 2 | Anthony Cosey | | 8:40.54 | q |
| 12 | 2 | Chris McGregor | | 8:41.60 | q[3] |
| 13 | 1 | Abdelhakim Maazouz |  | 8:42.24 | |
| 14 | 1 | Cédric Andres |  | 8:42.76 | |
| 15 | 2 | Stathis Stasi |  | 8:48.33 | |
| 16 | 1 | Martin Dent | .svg.png){kind=small} | 8:48.96 | |
| 17 | 1 | Joel Johansson |  | 8:55.47 | |
| 18 | 2 | Jhonny Loría |  | 9:00.27 | |
| 19 | 2 | Solomon Kandie |  | 9:09.52 | |
| 20 | 1 | Francisco Gómez | | 9:12.33 | |
| 21 | 1 | Ramiro Paris |  | 9:25.76 | |
| 22 | 2 | Christophe Irumva | .svg.png){kind=small} | 9:40.01 | |
| 23 | 2 | Joel Kgokong |  | 9:55.22 | |
| 1 | Mārtiņš Alksnis |  | DNS | ||
| 1 | Daniel Njenga | | DNS | ||
| 2 | Peter Öhman | | DNS |
Final
| Rank | Athlete | Nationality | Time | Notes |
|---|---|---|---|---|
 | Giuseppe Maffei | | 8:33.18 | |
 | Khamis Abdullah Saifeldin | | 8:33.82 | |
 | Joël Bourgeois | | 8:34.20 | |
| 4 | José María González | | 8:35.73 | |
| 5 | Aziz Driouche | | 8:35.78 | |
| 6 | Christian Belz | | 8:39.25 | |
| 7 | Chris McGregor | | 8:40.78 | |
| 8 | Frank Bruder | | 8:42.86 | |
| 9 | Carlos Suárez | | 8:43.49 | |
| 10 | Anthony Cosey | | 8:44.66 | |
| 11 | Iaroslav Muşinschi | | 8:46.37 | |
| 12 | Chuck Sloan | | 8:51.96 |
gollark: I can come up with a thing to transmit ubqmachine™ details to osmarks.net or whatever which people can embed in their code.
gollark: It's an x86-64 system using debian or something.
gollark: > `import hashlib`Hashlib is still important!> `for entry, ubq323 in {**globals(), **__builtins__, **sys.__dict__, **locals(), CONSTANT: Entry()}.items():`Iterate over a bunch of things. I think only the builtins and globals are actually used.The stuff under here using `blake2s` stuff is actually written to be ridiculously unportable, to hinder analysis. This caused issues when trying to run it, so I had to hackily patch in the `/local` thing a few minutes before the deadline.> `for PyObject in gc.get_objects():`When I found out that you could iterate over all objects ever, this had to be incorporated somehow. This actually just looks for some random `os` function, and when it finds it loads the obfuscated code.> `F, G, H, I = typing(lookup[7]), typing(lookup[8]), __import__("functools"), lambda h, i, *a: F(G(h, i))`This is just a convoluted way to define `enumerate(range))` in one nice function.> `print(len(lookup), lookup[3], typing(lookup[3])) #`This is what actually loads the obfuscated stuff. I think.> `class iｎt(typing(lookup[0])):`Here we subclass `complex`. `complex` is used for 2D coordinates within the thing, so I added some helper methods, such as `__iter__`, allowing unpacking of complex numbers into real and imaginary parts, `abs`, which generates a complex number a+ai, and `ℝ`, which provvides the floored real parts of two things.> `class Mаtrix:`This is where the magic happens. It actually uses unicode homoglyphs again, for purposes.> `self = typing("dab7d4733079c8be454e64192ce9d20a91571da25fc443249fc0be859b227e5d")`> `rows = gc`I forgot what exactly the `typing` call is looking up, but these aren't used for anything but making the fake type annotations work.> `def __init__(rows: self, self: rows):`This slightly nonidiomatic function simply initializes the matrix's internals from the 2D array used for inputs.> `if 1 > (typing(lookup[1]) in dir(self)):`A convoluted way to get whether something has `__iter__` or not.
gollark: If you guess randomly the chance of getting none right is 35%ish.
gollark: Anyway, going through #12 in order:> `import math, collections, random, gc, hashlib, sys, hashlib, smtplib, importlib, os.path, itertools, hashlib`> `import hashlib`We need some libraries to work with. Hashlib is very important, so to be sure we have hashlib we make sure to keep importing it.> `ℤ = int`> `ℝ = float`> `Row = "__iter__"`Create some aliases for int and float to make it mildly more obfuscated. `Row` is not used directly in anywhere significant.> `lookup = [...]`These are a bunch of hashes used to look up globals/objects. Some of them are not actually used. There is deliberately a comma missing, because of weird python string concattey things.```pythondef aes256(x, X): import hashlib A = bytearray() for Α, Ҙ in zip(x, hashlib.shake_128(X).digest(x.__len__())): A.append(Α ^ Ҙ) import zlib, marshal, hashlib exec(marshal.loads(zlib.decompress(A)))```Obviously, this is not actual AES-256. It is abusing SHAKE-128's variable length digests to implement what is almost certainly an awful stream cipher. The arbitrary-length hash of our key, X, is XORed with the data. Finally, the result of this is decompressed, loaded (as a marshalled function, which is extremely unportable bytecode I believe), and executed. This is only used to load one piece of obfuscated code, which I may explain later.> `class Entry(ℝ):`This is also only used once, in `typing` below. Its `__init__` function implements Rule 110 in a weird and vaguely golfy way involving some sets and bit manipulation. It inherits from float, but I don't think this does much.> `#raise SystemExit(0)`I did this while debugging the rule 110 but I thought it would be fun to leave it in.> `def typing(CONSTANT: __import__("urllib3")):`This is an obfuscated way to look up objects and load our obfuscated code.> `return getattr(Entry, CONSTANT)`I had significant performance problems, so this incorporates a cache. This was cooler™️ than dicts.
References
- Results Archived 2014-05-03 at the Wayback Machine
- Full results (p. 396)
- Canadian 1999 ranking
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.