Give me the solution to the following problem in Julia code:

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order , and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Example 1:
Input: l1 = [2,4,3], l2 = [5,6,4]
Output: [7,0,8]
Explanation: 342 + 465 = 807.
Example 2:

Input: l1 = [0], l2 = [0]
Output: [0]
Example 3:

Input: l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
Output: [8,9,9,9,0,0,0,1]
Constraints:

The number of nodes in each linked list is in the range [1, 100].
0 <= Node.val <= 9
It is guaranteed that the list represents a number that does not have leading zeros.
```julia
function addDigitLists(l1, l2)
    n1 = parse(Int, join(reverse(l1)))
    n2 = parse(Int, join(reverse(l2)))
    sum = n1 + n2
    return reverse(split(string(sum), ))
end
```
great ! now apply that function to a list of 100 random ints
Sure, here's some julia code that applies ``addDigitLists`` to a list of 100 random integers in pairs:

```julia
using Random

# Generate 100 random integers
Random.seed!(123)
lst = [rand(0:9) for i in 1:100]

# Call the addDigitLists function on pairs of elements from the list
result = [addDigitLists(lst[i], lst[i + 1]) for i in 1:2:length(lst) - 1]
```

This code generates a list ``lst`` of 100 random integers between 0 and 9, then applies the ``addDigitLists`` function to pairs of elements starting from the first two elements in the list and stores the results in a new list `result`. The loop range ``1:2:length(lst) - 1`` increments by 2, so that every other element is paired with the element immediately following it.