Recent public codes are listed below. You can filter them by the following programming languages:
- view
- All
- Ada
- Assembler
- Assembler
- AWK (gawk)
- AWK (mawk)
- Bash
- bc
- Brainf**k
- C
- C#
- C++
- C++0x
- C99 strict
- CLIPS
- Clojure
- COBOL
- COBOL 85
- Common Lisp (clisp)
- D (dmd)
- Erlang
- F#
- Factor
- Falcon
- Forth
- Fortran
- Go
- Groovy
- Haskell
- Icon
- Intercal
- Java
- JavaScript (rhino)
- JavaScript (spidermonkey)
- Lua
- Nemerle
- Nice
- Nimrod
- Objective-C
- Ocaml
- Oz
- Pascal (fpc)
- Pascal (gpc)
- Perl
- Perl 6
- PHP
- Pike
- Prolog (gnu)
- Prolog (swi)
- Python
- Python 3
- R
- Ruby
- Scala
- Scheme (guile)
- Smalltalk
- SQL
- Tcl
- Text
- Unlambda
- VB.NET
- Whitespace
-
1 2 3 4 5 6 7 8 9
eb 04 af c2 bf a3 81 ec 00 01 00 00 31 c9 88 0c 0c fe c1 75 f9 31 c0 ba ef be ad de 02 04 0c 00 d0 c1 ca 08 8a 1c 0c 8a 3c 04 88 1c 04 88 3c 0c fe c1 75 e8 e9 5c 00 00 00 89 e3 81 c3 04 00 00 00 5c 58 3d 41 41 41 41 75 43 58 3d 42 42 42 42 75 3b 5a 89 d1 89 e6 89 df 29 cf f3 a4 89 de 89 d1 89 df 29 cf 31 c0 31 db 31 d2 fe c0 02 1c 06 8a 14 06 8a 34 1e 88 34 06 88 14 1e 00 f2 30 f6 8a 1c 16 8a 17 30 da 88 17 47 49 75 de 31 db 89
-
1 2 3 4 5 6 7 8 9
eb04afc2bfa381ec 0cfec175f931c0ba d0c1ca088a1c0c8a fec175e8e95c0000 005c583d41414141 753b5a89d189e689 d189df29cf31c031 8a14068a341e8834 8a1c168a1730da88
...
-
1 2 3 4 5 6 7 8 9
eb 04 af c2 bf a3 81 ec 00 01 00 00 31 c9 88 0c 0c fe c1 75 f9 31 c0 ba ef be ad de 02 04 0c 00 d0 c1 ca 08 8a 1c 0c 8a 3c 04 88 1c 04 88 3c 0c fe c1 75 e8 e9 5c 00 00 00 89 e3 81 c3 04 00 00 00 5c 58 3d 41 41 41 41 75 43 58 3d 42 42 42 42 75 3b 5a 89 d1 89 e6 89 df 29 cf f3 a4 89 de 89 d1 89 df 29 cf 31 c0 31 db 31 d2 fe c0 02 1c 06 8a 14 06 8a 34 1e 88 34 06 88 14 1e 00 f2 30 f6 8a 1c 16 8a 17 30 da 88 17 47 49 75 de 31 db 89
-
1
eb 04 af c2 bf a3 81 ec 0c fe c1 75 f9 31 c0 ba d0 c1 ca 08 8a 1c 0c 8a fe c1 75 e8 e9 5c 00 00 00 5c 58 3d 41 41 41 41 75 3b 5a 89 d1 89 e6 89 d1 89 df 29 cf 31 c0 31 8a 14 06 8a 34 1e 88 34 8a 1c 16 8a 17 30 da 88 d8 fe c0 cd 80 90 90 e8 00 01 00 00 31 c9 88 0c ef be ad de 02 04 0c 00 3c 04 88 1c 04 88 3c 0c 00 89 e3 81 c3 04 00 00 75 43 58 3d 42 42 42 42 df 29 cf f3 a4 89 de 89 db 31 d2 fe c0 02 1c 06 06 88 14 1e 00 f2 30 f6 17 47 49 75 de 31 db 89 9d ff ff ff 41 41 41 41
-
1 2 3 4 5 6 7 8 9
eb 04 af c2 bf a3 81 ec 00 01 00 00 31 c9 88 0c 0c fe c1 75 f9 31 c0 ba ef be ad de 02 04 0c 00 d0 c1 ca 08 8a 1c 0c 8a 3c 04 88 1c 04 88 3c 0c fe c1 75 e8 e9 5c 00 00 00 89 e3 81 c3 04 00 00 00 5c 58 3d 41 41 41 41 75 43 58 3d 42 42 42 42 75 3b 5a 89 d1 89 e6 89 df 29 cf f3 a4 89 de 89 d1 89 df 29 cf 31 c0 31 db 31 d2 fe c0 02 1c 06 8a 14 06 8a 34 1e 88 34 06 88 14 1e 00 f2 30 f6 8a 1c 16 8a 17 30 da 88 17 47 49 75 de 31 db 89
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> main(t,_,a) char *a; { if ((!0) < t) {
...
-
1 2 3 4 5 6 7
#include <stdio.h> void main (int) {char x,y,z; printf("enter a three digits number"); scanf("%c%c%c",&x,&y,&z); printf("the reversal is :%c%c%c",z,y,x); return 0 ;}
-
1
$_='ajpxyixepqi!';y/a-qy/e-u /;s/x/er/g;s/(\w+)/\u$1/g;print
-
1 2 3 4 5 6 7 8 9
// by petter wahlman, twitter: @badeip // solution to part #1 of http://www.canyoucrackit.co.uk/ // // #include <stdio.h> #include <stdint.h> #include <malloc.h> #include <stdlib.h>
...
-
1
ë¯Â¿£ì???1Ɉ?þÁuù1Àºï¾Þ??ÐÁÊŠŠ<ˆˆ<?þÁuèé\???‰ãÃ????\X=AAAAuCX=BBBB?u;Z‰Ñ‰æ‰ß)Ïó¤‰Þ‰?щß)Ï1À1Û1ÒþÀ?ŠŠ4ˆ4ˆ?ò0ö?ŠŠ0ÚˆGIuÞ1Û‰?ØþÀÍ€èÿÿÿAAAA
-
1
11101011 00000100 10101111 11000010 10111111 10100011 10000001 11101100 00000000 00000001 00000000 00000000 00110001 11001001 10001000 00001100 00001100 11111110 11000001 01110101 11111001 00110001 11000000 10111010 11101111 10111110 10101101 11011110 00000010 00000100 00001100 00000000 11010000 11000001 11001010 00001000 10001010 00011100 00001100 10001010 00111100 00000100 10001000 00011100 00000100 10001000 00111100 00001100 11111110 11000001 01110101 11101000 11101001 01011100 00000000 00000000 00000000 10001001 11100011 10000001 11000011 00000100 00000000 00000000 00000000 01011100 01011000 00111101 01000001 01000001 01000001 01000001 01110101 01000011 01011000 00111101 01000010 01000010 01000010 01000010 01110101 00111011 01011010 10001001 11010001 10001001 11100110 10001001 11011111 00101001 11001111 11110011 10100100 10001001 11011110 10001001 11010001 10001001 11011111 00101001 11001111 00110001 11000000 00110001 11011011 00110001 11010010 11111110 11000000 00000010 00011100 00000110 10001010 00010100 00000110 10001010 00110100 00011110 10001000 00110100 00000110 10001000 00010100 00011110 00000000 11110010 00110000 11110110 10001010 00011100 00010110 10001010 00010111 00110000 11011010 10001000 00010111 01000111 01001001 01110101 11011110 00110001 11011011 10001001 11011000 11111110 11000000 11001101 10000000 10010000 10010000 11101000 10011101 11111111 11111111 11111111 01000001 01000001 01000001 01000001
-
1
10^20
-
1 2
10^20; print last;
-
1 2
a = 10; print a;
-
1 2
a = 10*148; print a;
-
1 2
a=10*148; print a;
-
1 2
a=10^148; print a;
-
1 2
a=10^148 print a
-
1
c(1)
-
1 2 3 4 5 6 7 8 9
/* read the numbers; notice: ech line of the input must be followed by an EOF character */ x = read(); /* multiplication table */ for (i=1; i<=x; ++i) { for (j=1; j<=x; ++j) print i*j, "\t" print "\n" }
...
-
1 2 3 4
INPUT I IF I >= 0 THEN PRINT "Positive number or null" : GOTO 40 PRINT "Negative number" END
-
1 2
print "Hello"; c end
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main() { int temp = sizeof(int); printf("%d :", temp); return 0; }
-
1
6 + 4
-
1 2 3 4 5 6 7 8 9
/* read the numbers; notice: ech line of the input must be followed by an EOF character */ x = read(); /* multiplication table */ for (i=1; i<=x; ++i) { for (j=1; j<=x; ++j) print i*j, "\t" print "\n" }
...
-
1 2
> v @,,,,,"Hello"<
-
1 2 3 4 5 6
++++++++++[>+>++>+++>++++>+++++>++++++>+++++++>++++++++>++++++++ +>++++++++++>+++++++++++>++++++++++++>+++++++++++++<<<<<<<<<<<<< -]>>>>>>>>>>>------.>----..----.<<<<<<--.<---..>>>>>>--.>+++.<-. -.>----.<+++++.<<<<<--------.<-.>>>>>>>-.<<---.>>++++.---.<----- .<<<<<<.>>>>>>>+++.+++.<<<<<<<+.>>>>>>>----.++++.<+.>--.+.<<<<<< <-.>>>>>>+++.>.<+++++.-.
-
1
print 123
-
1 2
scale=100000 4*a(1)
-
1 2 3 4 5 6 7 8 9
/* Use the fact that x^y == e^(y*log(x)) */ define p(x,y) { if (y == i(y)) { return (x ^ y) } return ( e( y * l(x) ) ) } p(2, 10.5)


