/prog/ Challenge

Write a program which solves for and prints the first 30 titanic primes. The person who writes the most efficient program wins. Use any language you like.

This is the fastest, yours are slower because they're line buffered coupled with some bloated C library, mine is fully buffered. I had to replace the next titanic primes with nothing for posting purposes.

section    .data
s:    db    "1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000007, ...", 0xa
len    equ    $ - s

section    .text
    mov    eax, 4
    mov    ebx, 1
    mov    ecx, s
    mov    edx, len
    int    0x80

    mov    eax, 1
    mov    ebx, 0
    int    0x80

The full program (with all the 30 first titanic primes) exited successfully.

[~/x86] time ./fastest > /dev/null

real    0m0.004s
user    0m0.000s
sys    0m0.004s