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 listJun 24, 2026 10:03anboto1anboto1Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 10:04015,748,2501,325,0005,300,00024,576Exit with code 1: c00=841582836 A_l/r/s=0/0/0 B_l/r/s=0/0/0 det=3101096456/1685256445 A=-802185184,1968904460,-1176231742,-675019095 B=-2071087159,-1327734478,-818445678,-185974279stderr