Regarding maximum input size, I'm sure it can be forked to implement a tweet-sharding approach.
Merging of tweet shards is also possible via the same mechanism. Just tweeterate through the retrieved shards and merge them one by one. To merge two lists, compare elements pairwise. To compare elements pairwise, construct a two element list and sort this list via the short-form tweetsort api.
Re:Twitter Sort
by emmanueloga_ on Wednesday January 14, 2015 @10:33PM
(#8890754)
For sorting big lists of numbers mergesort could be used, only resorting to twittersort when the list of numbers is small enough [1]. In fact, that's the way mergesort is generally implemented (except the "cutoff" algorithm is usually insertionsort, not tweetsort :p).
1: http://en.wikipedia.org/wiki/Merge_sort#Optimizing_merge_sor...
Sharding via a Tweet Storm(TM).
In the sorting world it's called a bucket, not a shard.
Where's your imagination? Three immediate solutions:
1 - gzip content to store in a tweet. You could squeeze more out.
2 - store the content in an image and standardize on an OCR library
3 - use twitlonger.com for larger messages
EDIT: Anyway I thought app.net was meant to solve all this?
OCR? dump the raw sequence as bytes and encode it into a valid PNG.
The trouble is that some mobile ISPs compress images (as I found to my surprise). I know it should be sacrosanct, but you can't rely on the same bytes coming out the other end. I think OCR would be more robust.
Otherwise you're potentially ruling out mobile users.
Put your numbers in a pastebin, then post a link to the pastebin. Then, when you get the sorted numbers, post the sorted sequence in the original pastebin, thus creating a cloud-backed repository of sorted variants of number sequences. After that, you can check if your sequence is already on pastebin before asking twitter!
Maybe each comparison could be done via a tweet request.
In short, I would advise against deploying this on production until technology is more mature.