• Code Jam 2009 ↓
  • Qualification Round
  • Round 1A
  • Round 1B
  • Round 1C
  • Round 2
  • Round 3
  • World Final
• Countries
• Languages
• Round 1A

Collecting Cards solutions

Collecting Cards was solved using Python by 42 contestants. Solution sizes: average 1283 bytes (shortest: 547; longest: 3213).

The list below is sorted by solution size. You can also sort by ranking.

ErickW (S) (547 B) ErickW (L) (547 B) phire (S) (676 B) zli (S) (685 B) zli (L) (685 B) Martial (S) (702 B) Martial (L) (702 B) misof (S) (728 B) misof (L) (728 B) cromero (S) (739 B) cromero (L) (739 B)

kmod (S) (878 B) kmod (L) (878 B) mariusd (S) (909 B) lidaobing (S) (911 B) lidaobing (L) (911 B) jzimmerman (S) (1131 B) jzimmerman (L) (1131 B) windowmaker (L) (1140 B) windowmaker (S) (1149 B) wmatthews (S) (1210 B) wmatthews (L) (1210 B)

isaacchao (S) (1215 B) isaacchao (L) (1215 B) eMBe (S) (1260 B) JoeClark (S) (1311 B) JoeClark (L) (1311 B) adragon (S) (1380 B) adragon (L) (1380 B) eMBe (L) (1391 B) ajt (S) (1500 B) ajt (L) (1500 B) PipeDream (S) (1565 B)

PipeDream (L) (1565 B) tc. (S) (1574 B) tc. (L) (1651 B) swiper (S) (1956 B) swiper (L) (1956 B) gizzywump (S) (2408 B) gizzywump (L) (2408 B) gregstoll (L) (3210 B) gregstoll (S) (3213 B)