TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

International Obfuscated Python Code Competition: Submissions Open

47 pointsby juliusgeoalmost 2 years ago

5 comments

juliusgeoalmost 2 years ago
Directly inspired by the classic C coding competition, the IOCCC, the IOPCC is now accepting submissions. This is my first time running a competition, so there will likely be some issues in this first year. Tentative plan for submissions end-date is outlined on <a href="https:&#x2F;&#x2F;pyobfusc.com&#x2F;#submit" rel="nofollow">https:&#x2F;&#x2F;pyobfusc.com&#x2F;#submit</a>.
评论 #36218702 未加载
BoppreHalmost 2 years ago
Brilliant, I&#x27;d love to participate. A few questions:<p>1. Are underhanded entries welcome, where the code <i>looks</i> straightforward but does something completely unexpected? For C it&#x27;s a separate contest[1], but I find a big overlap in the spirit.<p>2. Are there any tricks that are considered poor taste, like unicode fuckery, light pranks (think &quot;opening the CD tray&quot;, not &quot;forkbomb&quot;), or embedding code in other languages?<p>3. Max length limits? And do I get bonus points for extra short entries?<p>4. Is <i>optional</i> human input ok, like a game that by default plays itself?<p>5. Not really a question, but the website is very broken on wide screens[2].<p>[1]: <a href="http:&#x2F;&#x2F;www.underhanded-c.org&#x2F;" rel="nofollow">http:&#x2F;&#x2F;www.underhanded-c.org&#x2F;</a><p>[2]: <a href="https:&#x2F;&#x2F;i.imgur.com&#x2F;bTvKC9y.png" rel="nofollow">https:&#x2F;&#x2F;i.imgur.com&#x2F;bTvKC9y.png</a>
评论 #36219966 未加载
评论 #36219997 未加载
trompalmost 2 years ago
<p><pre><code> import sys def c(j,t): sys.stdout.write(j(&#x27;.&#x27;)(&#x27;P&#x27;)) return t (lambda z:lambda y:z(z(y(lambda p:lambda n:(lambda s:lambda z:z(lambda x: lambda y:y)(lambda d:p(s)(y(s))(d)))(lambda x:lambda a:lambda s:lambda p: p(a)(lambda y:s(n(x))(y))))(lambda c:lambda a:lambda s:z(lambda y:s(c)(y) ))))(y(lambda p:lambda b:lambda t:t(c(b,p)))))(lambda s:lambda p:p(lambda x:lambda y:x)(s))(lambda f:(lambda q:q(q))(lambda x:f(lambda y:x(x)(y)))) </code></pre> Guess the pattern of Ps in the output (probably need to redirect stderr to &#x2F;dev&#x2F;null)
评论 #36219308 未加载
评论 #36232096 未加载
apeterssonalmost 2 years ago
_ = (lambda _, __, ___: (lambda _, __, ___, ____: {_[___](____)[_(__)](_(___, ____)) for ___ in _}[_](__, _(___, __))) ( (lambda _: _ % 2 and _ &#x2F;&#x2F; 2 or _ * 5 + 1), (lambda _: _ &lt;&lt; 1), 2, 1 ) )[(lambda _, __: _ &lt;&lt; __), 5, 2]<p>Guess what that is doing
评论 #36218512 未加载
ASalazarMXalmost 2 years ago
I hope this doesn&#x27;t come out as whining, but could you add an RSS feed so we can keep track of every contest? The IOCCC wasn&#x27;t held every year, and the feed was very helpful to keep tabs on it.
评论 #36219693 未加载