A small Python URL bruteforce

Hello /prog/, I need help with, well, programming.

I want to bruteforce URLs of the form sys.AAA.org/XXXX/BBB in python and sort the results by success or failure (determined by the returned text). AAA is a given website and BBB a given address.

XXXX is a 1 to 4 characters word using lowercase letters and numbers that I need to bruteforce.

Any tips or example on how to make a very simple bruteforce code in Python, I'm very new to this ?

>>15
Laziness makes it difficult to reason about when computation happens, and it can result in serious space leaks. I’ve been writing Haskell for over a decade and using it as my main language at work for at least five years, and I’ve never learned to do efficient code beyond simple cases. Purity makes it painful to discover and propagate run-time configuration information, while in most languages it’s easy to read a configuration file at startup and store the result in a global variable, but in Haskell that requires dirty tricks. Haskell module system (if you can even call it that) is clearly inferior to Standard ML’s and OCaml’s module systems. Its compile-time meta-programming facility, Template Haskell, is occasionally useful, but it’s a poor substitute for a real, Lisp macro system. Haskell’s type system, even with recent extensions in that direction, won’t let you prove as much as Coq or Agda. Haskell changes quickly and sometimes unpredictably; Haskell code breaks and needs to be updated not only for major GHC version increments but often for minor versions as well. Finally, Haskell does suffer some social weaknesses by being weird and researchy. Because Haskell is so different from the languages that most people know, it presents steep learning curve.