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 listDec 22, 2023 18:53Oleg KovalovOleg KovalovError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2023 18:5300000Error: Exit with code 2: SIGSEGV: segmentation violation PC=0x56155bcf4448 m=0 sigcode=1 signal arrived during cgo execution goroutine 1 [syscall]: runtime.cgocall(0x56155bcf4580, 0xc00002c710) /tmp/go1.21.5/go/src/runtime/cgocall.go:157 +0x4b fp=0xc...stderr
2Dec 22, 2023 18:5500000Error: pos 0: expected 218 got 170