You write custom CUDA kernels to replace the pytorch operators in the given architecture to get speedups. 

    You have complete freedom to choose the set of operators you want to replace. You may make the decision to replace some operators with custom CUDA kernels and leave others unchanged. You may replace multiple operators with custom implementations, consider operator fusion opportunities (combining multiple operators into a single kernel, for example, combining matmul+relu), or algorithmic changes (such as online softmax). You are only limited by your imagination.


        Here's an example to show you the syntax of inline embedding custom CUDA operators in torch: The example given architecture is: 

        ``` 

        # Copyright (c) Meta Platforms, Inc. and affiliates.
# All rights reserved.
#
# This source code is licensed under the license found in the
# LICENSE file in the root directory of this source tree.

import torch
import torch.nn as nn
import torch.nn.functional as F


class Model(nn.Module):
    def __init__(self) -> None:
        super().__init__()

    def forward(self, a, b):
        return a + b


def get_inputs():
    # randomly generate input tensors based on the model architecture
    a = torch.randn(1, 128).cuda()
    b = torch.randn(1, 128).cuda()
    return [a, b]


def get_init_inputs():
    # randomly generate tensors required for initialization based on the model architecture
    return []

        ``` 

        The example new arch with custom CUDA kernels looks like this:
        ```
        # Copyright (c) Meta Platforms, Inc. and affiliates.
# All rights reserved.
#
# This source code is licensed under the license found in the
# LICENSE file in the root directory of this source tree.

import torch
import torch.nn as nn
import torch.nn.functional as F
from torch.utils.cpp_extension import load_inline

# Define the custom CUDA kernel for element-wise addition
elementwise_add_source = """
#include <torch/extension.h>
#include <cuda_runtime.h>

__global__ void elementwise_add_kernel(const float* a, const float* b, float* out, int size) {
    int idx = blockIdx.x * blockDim.x + threadIdx.x;
    if (idx < size) {
        out[idx] = a[idx] + b[idx];
    }
}

torch::Tensor elementwise_add_cuda(torch::Tensor a, torch::Tensor b) {
    auto size = a.numel();
    auto out = torch::zeros_like(a);

    const int block_size = 256;
    const int num_blocks = (size + block_size - 1) / block_size;

    elementwise_add_kernel<<<num_blocks, block_size>>>(a.data_ptr<float>(), b.data_ptr<float>(), out.data_ptr<float>(), size);

    return out;
}
"""

elementwise_add_cpp_source = (
    "torch::Tensor elementwise_add_cuda(torch::Tensor a, torch::Tensor b);"
)

# Compile the inline CUDA code for element-wise addition
elementwise_add = load_inline(
    name="elementwise_add",
    cpp_sources=elementwise_add_cpp_source,
    cuda_sources=elementwise_add_source,
    functions=["elementwise_add_cuda"],
    verbose=True,
    extra_cflags=[""],
    extra_ldflags=[""],
)


class ModelNew(nn.Module):
    def __init__(self) -> None:
        super().__init__()
        self.elementwise_add = elementwise_add

    def forward(self, a, b):
        return self.elementwise_add.elementwise_add_cuda(a, b)

        ``` 

        
    You are given the following architecture: 

    ```
    # Copyright (c) Meta Platforms, Inc. and affiliates.
# All rights reserved.
#
# This source code is licensed under the license found in the
# LICENSE file in the root directory of this source tree.

import torch
import torch.nn as nn

class Model(nn.Module):
    """
    Simple model that performs a single matrix multiplication (C = A * B) with a large K dimension
    """
    def __init__(self):
        super(Model, self).__init__()
    
    def forward(self, A: torch.Tensor, B: torch.Tensor) -> torch.Tensor:
        """
        Performs matrix multiplication of A and B.

        Args:
            A: Input tensor of shape (M, K)
            B: Input tensor of shape (K, N)

        Returns:
            Output tensor of shape (M, N)
        """
        return torch.matmul(A, B)

M = 256
N = 256
K = 131072 * 4

def get_inputs():
    A = torch.rand(M, K)
    B = torch.rand(K, N)
    return [A, B]

def get_init_inputs():
    return []  # No special initialization inputs needed
    ```
    
Optimize the architecture named Model with custom CUDA operators! Name your optimized output architecture ModelNew. Output the new code in codeblocks. Please generate real code, NOT pseudocode, make sure the code compiles and is fully functional. Just output the new model code, no other text, and NO testing code! 



This is turn 2 of 6 for this task. Your previous solution (turn 1) was:
```python
# Copyright (c) Meta Platforms, Inc. and affiliates.
# All rights reserved.
#
# This source code is licensed under the license found in the
# LICENSE file in the root directory of this source tree.

import torch
import torch.nn as nn
from torch.utils.cpp_extension import load_inline

# Custom split-K TF32 tensor-core GEMM optimized for the (small M/N, huge K) regime.
# C[m,n] = sum_k A[m,k] * B[k,n]
#  - Block tile: 128 x 256, warp tile 32 x 64, BK = 32
#  - K is split across many blocks; partial results go to a workspace
#  - A light reduction kernel sums the partials into C (FP32 accumulation)
#  - Tensor-core math is TF32 (allowed by the task), accumulation is FP32.

cuda_src = r"""
#include <torch/extension.h>
#include <ATen/cuda/CUDAContext.h>
#include <cuda_runtime.h>
#include <stdint.h>

#define BM 128
#define BN 256
#define BK 32
#define NTHREADS 512
#define NWARPS 16
#define BS_STRIDE (BN + 8)

#define CP_ASYNC_16(dst, src, bytes) \
    asm volatile("cp.async.ca.shared.global [%0], [%1], 16, %2;\n" :: "r"(dst), "l"(src), "r"(bytes))
#define CP_COMMIT() asm volatile("cp.async.commit_group;\n" ::)
#define CP_WAIT1() asm volatile("cp.async.wait_group 1;\n" ::)
#define CP_WAIT0() asm volatile("cp.async.wait_group 0;\n" ::)

__global__ void __launch_bounds__(NTHREADS, 1)
gemm_splitk_tf32(const float* __restrict__ A, const float* __restrict__ B,
                 float* __restrict__ W, int M, int N, int K, int splits) {
    extern __shared__ float smem[];
    float* As = smem;                       // 2 stages * BM * BK
    float* Bs = smem + 2 * BM * BK;         // 2 stages * BK * BS_STRIDE

    const int tid = threadIdx.x;
    const int lane = tid & 31;
    const int warp = tid >> 5;

    const int m_tiles = (M + BM - 1) / BM;
    const int tile_id = blockIdx.x % m_tiles;
    const int split   = blockIdx.x / m_tiles;
    const int m0 = tile_id * BM;

    const int total_iters = (K + BK - 1) / BK;
    const int iters_per = (total_iters + splits - 1) / splits;
    const int it_begin = split * iters_per;
    int it_end = it_begin + iters_per;
    if (it_end > total_iters) it_end = total_iters;
    if (it_begin >= it_end) return;
    const int S = it_end - it_begin;

    // -------- async global -> shared prefetchers --------
    auto prefetch = [&](int s) {
        const int k0 = (it_begin + s) * BK;
        float* Ad = As + (s & 1) * (BM * BK);
        float* Bd = Bs + (s & 1) * (BK * BS_STRIDE);
        // A tile: BM rows x BK cols, 16B chunks, XOR swizzled columns
        {
            int r = tid >> 3, c = tid & 7;
            int row = r, row2 = r + 64;
            uint32_t base = (uint32_t)__cvta_generic_to_shared(Ad);
            bool p1 = (m0 + row) < M;
            bool p2 = (m0 + row2) < M;
            const float* s1 = A + (int64_t)(m0 + (p1 ? row : 0)) * K + k0 + c * 4;
            const float* s2 = A + (int64_t)(m0 + (p2 ? row2 : 0)) * K + k0 + c * 4;
            int rem1 = K - (k0 + c * 4);
            int rem2 = K - (k0 + c * 4);
            int sz1 = (p1 && rem1 > 0) ? (rem1 >= 4 ? 16 : rem1 * 4) : 0;
            int sz2 = (p2 && rem2 > 0) ? (rem2 >= 4 ? 16 : rem2 * 4) : 0;
            uint32_t a1 = base + (uint32_t)((row * BK + ((c ^ (row & 7)) << 2)) * 4);
            uint32_t a2 = base + (uint32_t)((row2 * BK + ((c ^ (row2 & 7)) << 2)) * 4);
            CP_ASYNC_16(a1, s1, sz1);
            CP_ASYNC_16(a2, s2, sz2);
        }
        // B tile: BK rows x BN cols (padded stride)
        {
            int r = tid >> 4, c = tid & 15;
            uint32_t base = (uint32_t)__cvta_generic_to_shared(Bd);
            #pragma unroll
            for (int i = 0; i < 4; ++i) {
                int row = r + i * 8;
                int col = c * 4;
                bool pg = (k0 + row) < K;
                int remc = N - col;
                int sz = (pg && remc > 0) ? (remc >= 4 ? 16 : remc * 4) : 0;
                const float* src = B + (int64_t)(k0 + (pg ? row : 0)) * N + col;
                uint32_t addr = base + (uint32_t)((row * BS_STRIDE + col) * 4);
                CP_ASYNC_16(addr, src, sz);
            }
        }
        CP_COMMIT();
    };

    // -------- accumulators --------
    const int wm = warp >> 2;          // 0..3
    const int wn = warp & 3;           // 0..3
    const int warp_m0 = wm * 32;
    const int warp_n0 = wn * 64;

    float acc[2][8][4];
    #pragma unroll
    for (int i = 0; i < 2; ++i)
        #pragma unroll
        for (int j = 0; j < 8; ++j)
            #pragma unroll
            for (int v = 0; v < 4; ++v) acc[i][j][v] = 0.f;

    // ldmatrix source lane pattern (row within 16x16B-swizzled tile)
    const int lds_row = ((lane & 15) >> 3) * 8 + (lane & 7);
    const int lds_colf = (lane >> 4) * 4;   // 0 or 4 floats

    prefetch(0);

    for (int s = 0; s < S; ++s) {
        if (s + 1 < S) { prefetch(s + 1); CP_WAIT1(); }
        else           { CP_WAIT0(); }
        __syncthreads();

        const float* Ac = As + (s & 1) * (BM * BK);
        const float* Bc = Bs + (s & 1) * (BK * BS_STRIDE);

        #pragma unroll
        for (int kk = 0; kk < BK; kk += 8) {
            // ---- load A fragments (2 x m16k8) ----
            uint32_t afr[2][4];
            #pragma unroll
            for (int i = 0; i < 2; ++i) {
                int row = warp_m0 + i * 16 + lds_row;
                int col = kk + lds_colf;
                uint32_t addr = (uint32_t)__cvta_generic_to_shared(
                    Ac + row * BK + ((((col) >> 2) ^ (row & 7)) << 2) + ((col) & 3));
                asm volatile(
                    "ldmatrix.sync.aligned.m8n8.x4.shared.b16 {%0,%1,%2,%3}, [%4];\n"
                    : "=r"(afr[i][0]), "=r"(afr[i][1]), "=r"(afr[i][2]), "=r"(afr[i][3])
                    : "r"(addr));
            }
            // ---- load B fragments (8 x k8n8) ----
            uint32_t bfr[8][2];
            #pragma unroll
            for (int j = 0; j < 8; ++j) {
                int kk0 = kk + (lane & 3);
                int nn0 = warp_n0 + j * 8 + (lane >> 2);
                bfr[j][0] = __float_as_uint(Bc[kk0 * BS_STRIDE + nn0]);
                bfr[j][1] = __float_as_uint(Bc[(kk0 + 4) * BS_STRIDE + nn0]);
            }
            // ---- 16 tensor-core MMAs ----
            #pragma unroll
            for (int i = 0; i < 2; ++i) {
                #pragma unroll
                for (int j = 0; j < 8; ++j) {
                    asm volatile(
                        "mma.sync.aligned.m16n8k8.row.col.f32.tf32.tf32.f32 "
                        "{%0,%1,%2,%3}, {%4,%5,%6,%7}, {%8,%9}, {%0,%1,%2,%3};\n"
                        : "+f"(acc[i][j][0]), "+f"(acc[i][j][1]),
                          "+f"(acc[i][j][2]), "+f"(acc[i][j][3])
                        : "r"(afr[i][0]), "r"(afr[i][1]), "r"(afr[i][2]), "r"(afr[i][3]),
                          "r"(bfr[j][0]), "r"(bfr[j][1]));
                }
            }
        }
        __syncthreads();
    }

    // -------- epilogue: write partial tile to workspace --------
    float* Ws = W + (int64_t)split * M * N;
    const int gr = lane >> 2;          // group id 0..7
    const int tg = lane & 3;           // thread in group 0..3
    #pragma unroll
    for (int i = 0; i < 2; ++i) {
        #pragma unroll
        for (int j = 0; j < 8; ++j) {
            int r0 = m0 + warp_m0 + i * 16 + gr;
            int c0 = warp_n0 + j * 8 + tg * 2;
            if (r0 < M && c0 + 1 < N) {
                *reinterpret_cast<float2*>(Ws + (int64_t)r0 * N + c0) =
                    make_float2(acc[i][j][0], acc[i][j][1]);
            } else {
                if (r0 < M && c0 < N) Ws[(int64_t)r0 * N + c0] = acc[i][j][0];
                if (r0 < M && c0 + 1 < N) Ws[(int64_t)r0 * N + c0 + 1] = acc[i][j][1];
            }
            int r1 = r0 + 8;
            if (r1 < M && c0 + 1 < N) {
                *reinterpret_cast<float2*>(Ws + (int64_t)r1 * N + c0) =
                    make_float2(acc[i][j][2], acc[i][j][3]);
            } else {
                if (r1 < M && c0 < N) Ws[(int64_t)r1 * N + c0] = acc[i][j][2];
                if (r1 < M && c0 + 1 < N) Ws[(int64_t)r1 * N + c0 + 1] = acc[i][j][3];
            }
        }
    }
}

__global__ void reduce_splits_kernel(const float* __restrict__ W,
                                     float* __restrict__ C,
                                     int64_t slice_elems, int splits) {
    int64_t idx = (int64_t)(blockIdx.x * blockDim.x + threadIdx.x) * 4;
    if (idx >= slice_elems) return;
    const float4* w = reinterpret_cast<const float4*>(W + idx);
    float4 s = w[0];
    for (int p = 1; p < splits; ++p) {
        float4 v = *reinterpret_cast<const float4*>(W + (int64_t)p * slice_elems + idx);
        s.x += v.x; s.y += v.y; s.z += v.z; s.w += v.w;
    }
    *reinterpret_cast<float4*>(C + idx) = s;
}

torch::Tensor matmul_cuda(torch::Tensor A, torch::Tensor B) {
    TORCH_CHECK(A.is_cuda() && B.is_cuda(), "inputs must be CUDA tensors");
    TORCH_CHECK(A.dtype() == torch::kFloat32 && B.dtype() == torch::kFloat32,
                "inputs must be float32");
    TORCH_CHECK(A.dim() == 2 && B.dim() == 2, "inputs must be 2-D");
    const int M = (int)A.size(0);
    const int K = (int)A.size(1);
    const int N = (int)B.size(1);
    TORCH_CHECK((int)B.size(0) == K, "inner dimensions must match");

    auto Ac = A.contiguous();
    auto Bc = B.contiguous();
    auto C = torch::empty({M, N}, A.options());
    if (M == 0 || N == 0) return C;
    if (K == 0) { C.zero_(); return C; }

    auto stream = at::cuda::getCurrentCUDAStream();

    const int m_tiles = (M + BM - 1) / BM;
    const int total_iters = (K + BK - 1) / BK;
    int splits = total_iters / 128;      // aim for >=128 BK-iterations per block
    if (splits < 1) splits = 1;
    if (splits > 128) splits = 128;
    if (splits > total_iters) splits = total_iters;

    auto W = torch::empty({(int64_t)splits * M * N}, A.options());

    const int smem_bytes = (2 * BM * BK + 2 * BK * BS_STRIDE) * (int)sizeof(float);
    static bool attr_set = false;
    if (!attr_set) {
        cudaFuncSetAttribute(gemm_splitk_tf32, cudaFuncAttributeMaxDynamicSharedMemorySize, smem_bytes);
        attr_set = true;
    }

    dim3 grid((unsigned)(m_tiles * splits));
    gemm_splitk_tf32<<<grid, NTHREADS, smem_bytes, stream>>>(
        Ac.data_ptr<float>(), Bc.data_ptr<float>(), W.data_ptr<float>(), M, N, K, splits);

    const int64_t slice_elems = (int64_t)M * N;
    const int64_t quads = slice_elems / 4;
    if (quads * 4 == slice_elems) {
        int threads = 256;
        int blocks = (int)((quads + threads - 1) / threads);
        reduce_splits_kernel<<<blocks, threads, 0, stream>>>(
            W.data_ptr<float>(), C.data_ptr<float>(), slice_elems, splits);
    } else {
        // generic fallback for tiny/odd sizes
        auto Cv = C.view({slice_elems});
        for (int p = 0; p < splits; ++p) {
            if (p == 0) Cv.copy_(W.slice(0, 0, slice_elems));
            else Cv.add_(W.slice(0, (int64_t)p * slice_elems, (int64_t)(p + 1) * slice_elems));
        }
    }
    return C;
}
"""

cpp_src = "torch::Tensor matmul_cuda(torch::Tensor A, torch::Tensor B);"

_mod = load_inline(
    name="splitk_tf32_gemm",
    cpp_sources=cpp_src,
    cuda_sources=cuda_src,
    functions=["matmul_cuda"],
    verbose=False,
    extra_cuda_cflags=[
        "-O3",
        "--use_fast_math",
        "-gencode=arch=compute_80,code=sm_80",
        "-gencode=arch=compute_90,code=sm_90",
    ],
)


class ModelNew(nn.Module):
    """
    Matrix multiplication C = A * B implemented with a custom split-K TF32
    tensor-core CUDA kernel (FP32 accumulation), optimized for large K.
    """
    def __init__(self):
        super(ModelNew, self).__init__()

    def forward(self, A: torch.Tensor, B: torch.Tensor) -> torch.Tensor:
        return _mod.matmul_cuda(A, B)
```
Result of evaluating it:
The solution compiled but failed at run time. Error output:
```
torch.AcceleratorError: CUDA error: an illegal memory access was encountered
Search for `cudaErrorIllegalAddress' in https://docs.nvidia.com/cuda/cuda-runtime-api/group__CUDART__TYPES.html for more information.
CUDA kernel errors might be asynchronously reported at some other API call, so the stacktrace below might be incorrect.
For debugging consider passing CUDA_LAUNCH_BLOCKING=1
The CUDA driver logged these messages, which may provide useful details:
Sticky error detected
Returning 700 (CUDA_ERROR_ILLEGAL_ADDRESS) from cuMemFree_v2
```

Write an improved complete ModelNew: fix any error, and if the solution is already correct, make it faster. Output the new code in one ```python codeblock. Just the model code, no other text, and NO testing code.


Precision rule: the timed forward must compute in FP32 (TF32 tensor-core math is allowed, as in the PyTorch reference). Do not cast inputs, weights or intermediate results to float16 or bfloat16 and do not call half-precision kernels in forward().
