Large matrix multiplication Liam

Multiply two square matrices as fast as possible.

Input

Two 2000 x 2000 matrices of uint32 values on STDIN, encoded back-to-back in row-major order, little-endian byte order.

Output

Write the resulting 2000 x 2000 product matrix to STDOUT in the same binary format (row-major, little-endian uint32).

Back to listOct 21, 2026 00:30e1011e1011Error
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 00:3106,005,707,6435,989,023,0005,745,00016,793,600pos 4: expected 232 got 16
2Oct 21, 2026 00:3106,041,733,9566,023,523,0005,649,00016,793,600pos 4: expected 92 got 39
3Oct 21, 2026 00:3106,037,540,6196,021,015,0005,677,00016,793,600pos 4: expected 87 got 175