I can say right away that this is unoptimized, given that the start of the run is aiming for one goal and the end of the run for another. (Not to mention that the start of the run has known errors anyway.) If anything, the best description for this is a testrun, and we don't normally submit those.
I'm actually surprised you didn't re-TAS from the start aiming for speed as the goal. A realtime TAS would look quite different from a gametime TAS, and likely make different route choices. One of the reasons I haven't worked towards one is a) people seemed to prefer gametime and b) gametime is easier to optimize.
This also arguably fails to beat all existing records. nht has an
UnNetHack TAS in 16 seconds. UnNetHack is not the same game; it actually contains *fewer* bugs (nht used it due to the turn 2000 barrier not existing in UnNethack, and also because Un's set seed feature was buggy and made this possible to pull off on public servers). Because nht's run did only minimal luck manipulation, it is likely possible to go much faster than that. OTOH, I suspect that much of the reason for nht's advantage simply comes from using a faster computer.
Anyway, I appreciate that this run was meant to troll me, and despite believing it shouldn't be published, that doesn't mean I can't enjoy it. I'd like to make an encode but the Perl library IO::Pty::HalfDuplex (which I normally use for the purpose) has been broken for a while and I'm not immediately sure how to fix it. If someone is on a UNIXy system on which the command
cpanm -S Term::VT102 IO::Pty::HalfDuplex
runs to completion without freezing during IO::Pty::HalfDuplex's tests (note that this uses sudo in order to install some Perl modules, and you might need to install cpanm first), please let me know and we might be able to use your system to make the encoding. (It fails on recent Linux, but might hopefully work on old Linux or perhaps a BSD.)