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 listMar 4, 2024 10:11Huy Duc LeHuy Duc LeError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2024 10:1100000Error: Exit with code 1: ================================================================= ==1==ERROR: AddressSanitizer: global-buffer-overflow on address 0x55a3672d4a14 at pc 0x7f210fa6458d bp 0x7fff94893c20 sp 0x7fff948933c8 WRITE of size 256 at 0x55...stderr