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.

Challenge: Put all of Shakespeare's works into the smallest HTML file you can

20 pointsby tbodtalmost 8 years ago

4 comments

userbinatoralmost 8 years ago
I&#x27;m guessing whoever manages to implement a subset of <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;PAQ" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;PAQ</a> in JS is probably going to win.<p>Of course, the decompressor itself also needs to be compressed, which I suspect will be where most of the competition will happen.
评论 #14825593 未加载
xemalmost 8 years ago
Hi! I created that challenge but didn&#x27;t see this HN page until now :) That&#x27;s where all this traffic comes from! If you think 30 min is too short for decompression, I can change that rule. Just let me know.
newman8ralmost 8 years ago
another good challenge would to be trying to display them in the most interesting way possible in under x bytes, demoscene style. But I suppose that&#x27;s a different audience.
评论 #14831291 未加载
dunkmasteralmost 8 years ago
Easy 0 byte compressed solution: just put the entire output in the decompressor and print it. This doesn&#x27;t seem to be against the stated rules.
评论 #14825443 未加载
评论 #14827232 未加载
评论 #14826394 未加载