Converting from base-10 to word
Improving conv

To convert a base-10 number to base-N, I don't think it gets faster than the conv function your wrote. I would write it a bit differently though:

void toBaseN(ull num, const char *alpha, int base, char *word) {
    while (num) {
       *(word++) = alpha[(num - 1) % base];
       num = (num - 1) / base;
    }
}


What I changed:


Renamed the function: conv doesn't describe what it does
Rearranged the parameters: base is tightly related to alpha (the length), and I think it's good to have out-parameters as last
Add spaces around the operators to improve readability


For the record, this function doesn't return what I would expect.
It returns the digits in reverse order, which is a bit odd.
For example with the given alphabet,
it returns ba for 33 and ca for 34, when I would expect ab and ac, respectively.

The function has a number expectations with regards to the input:


word is expected to be big enough to contain the digits
word is expected to be filled with nulls
base is expected to be the length of alpha


The first one is reasonable and quite natural,
the others are not, and should be documented in a comment above the function.

Improving main


const char alpha[]="abcdefghijklmnopqrstuvwxyzOSR34"; 
char *word=calloc(30,sizeof(char));
// word always contains null-terminator
int base=(int)strlen(alpha);
for (nu=1;nu&lt;=1e8;++nu) {



There are a couple of things I don't like about this bit:


Too packed code: add more spaces around operators like I did in the previous point
The comment // word always contains null-terminator seems misplaced. It seems you intended it for the line above it. It's more intuitive and readable to have comments above the line they refer to. The make it even more clear, it would be good to leave a blank line before the comment, and perhaps even after the statement
What is magic number 30? It would be better to make this a global constant
base is derived from alpha, it's tightly related, so I'd move these closer to each other


I suggest this writing style:

const char alpha[] = "abcdefghijklmnopqrstuvwxyzOSR34";
int base = (int) strlen(alpha);

// word always contains null-terminator
char *word = calloc(30, sizeof(char));

for (nu = 1; nu &lt;= 1e8; ++nu) {


Improving speed

As I mentioned above, the general functionality of conv without a context is as fast as it can be. (And incorrect: normally I'd expect digits to be reversed.)

In the context of printing base-N numbers within the range [start : end],
you can do better.
You could convert start and end to base-N,
to do the counting in base-N.
This will be significantly faster than counting in base-10 and converting in every step.