In C, you can perform a simple:

```
int a = b + c;

```

Now, if `a` is larger than 2^32 (or maybe it's 2^31+1), you'd change the code to:

```
long a = b + c;

```

or

```
unsigned long a = b + c;

```

But how would you implement addition like:

```
bigint a = b + c;

```

where bigint is some sort of class/typedef/structure for storing and computing large integers (numbers that are hundreds of digits long). If you were just trying to add numbers together using a standard, hand-written decimal approach from elementary school, you can do infinitely long numbers in the equation. But come around to Computer Science, how can you use a binary, efficient approach where you can do infinitely long computations (provided enough RAM is available)

More so, is there a way of doing this that isn't terribly slow?