String Manipulation

(* Hackthissite.org Programming level 12. 

Problem text:
This level is about string manipulation.
In this challenge, you will be given a string. 
Take all the numbers from the string and classify them as 
composite numbers or prime numbers. 
You should assume all numbers are one digit, and neither 
number 1 nor number 0 counts. 

Find the sum of every composite number, 
then find the sum of every prime number. 
Multiply these sums together. 
Then, take the first 25 non-numeric characters of 
the given string and increment their ASCII value by one 
(for example, # becomes $). 
Take these 25 characters and concatenate the product to them. 
This is your answer.
Your answer should look like this: oc{lujxdpb%jvqrt{luruudtx140224

Summarised algorithm.
1. extract single numbers from string excluding 1 and 0
2. classify sequence as prime or composite.
3. sum primes and sum composites, multiply result
4. take first 25 non-numeric chars, increment ascii value by 1.
5. concat product from step 3 to the value of step 4.
*)

let strToInts : string -> int seq = Seq.map int

(* ignoring '0' and '1' *)
let isValidNumber d = d > 49 && d < 58

let extractNumbers str = 
  strToInts str
  |> Seq.filter isValidNumber
  |> Seq.map (char >> string >> int)
 
(* since we only need 2..9 lets just hardcode this *)
let isPrime d =
  [2; 3; 5; 7] |> Seq.exists ((=) d)

type numberType = Prime of int | Compo of int 

let extractNumberTypes xs = 
  xs |> Seq.map (fun x -> if isPrime x then Prime x else Compo x)

let getNumberType f xs = xs |> Seq.filter f

let prime = function Prime x -> true | _ -> false
let compo = function Compo x -> true | _ -> false

let extractCompos xs = xs |> getNumberType compo
let extractPrimes xs = xs |> getNumberType prime

let f (Prime x | Compo x) = x

let sum = Seq.fold (fun acc elem -> f elem + acc) 0

let numbers = extractNumbers >> extractNumberTypes

let calculateSumProduct input = 
  let numbers' = numbers input
  let compos   = extractCompos numbers'
  let primes   = extractPrimes numbers'

  sum compos * sum primes

let takeFirst25NonNumeric (xs : string) = 
  xs |> Seq.choose (fun x -> if int x > 47 && int x < 58 then None else Some x)
     |> Seq.take 25

let incrementAsciiByOne (xs : char seq) =
  xs |> Seq.map (fun x -> char <| int x + 1)

let toString : char seq -> string = Seq.map string >> String.concat ""

(* we send this to clipboard as site has a 5 second timelimit to give answer. *)
let generateAnswer input = 
  input
  |> takeFirst25NonNumeric 
  |> incrementAsciiByOne
  |> toString
  |> fun result -> result ^ (calculateSumProduct input |> string)
  |> System.Windows.Forms.Clipboard.SetText

generateAnswer "@yfe1ihmjbm@4shk$@jn8i5udt@w3ytg9$adra293ll@#1$boxeust8fe56ra41fu$ckfo9cuic0nk9c2xp2qmt$8d#bksgtuvss4tmw8bs91axn7gbyuz1kwewon0matt?rnk0q1jl3ml7tcya0pmir13ekm@z@v#uonxfo?vxa6d@#eg09rqlkqc3vwb#jcshizhh5w83jc9czsljzji46dapl$h8g#rny1lwcddh8m07xt8s$xngvzg2rwnedz1xxa2rey4t@4fvj0m?#l1rkf1@ox#2rsbpt7hdftltp9om26kd@xb@tvet25$j1f5dx3pfur$e3asyzv0tm9rseu2iogusr0z#hjyui35i4oeu?1qu8nio@tmgv7qigar5j#1mx707mxobh23i7wp#fn77f#bry$@#20h4w31bdnhs5woyupo3h@8gd8ukoqjnn41q9ekjy07fp4v761wqkck7ex#$q$gm82o#tmh3c7#1ju@j9p2t3m#qp5o4hnmy5enye48om?z5#hfhbc05yugmx57j3n3$gi?0rebwxdehtc$e431ldvy?v1xtej3mxxploweuyprfwnn0@#6l?tyss2m@8ge9rgq@#o0g5@s@ox7cdz181tcq4?f#i"