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 listNov 29, 2024 23:50E SequeiraE SequeiraError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2024 23:5000000Error: Exit with code 2: unexpected fault address 0xc005800e00 fatal error: fault [signal SIGSEGV: segmentation violation code=0x2 addr=0xc005800e00 pc=0x564ef5f0f179] goroutine 1 gp=0xc0000061c0 m=0 mp=0x564ef6012220 [running]: runtime.throw({0x564ef...stderr