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 09:51anboto1anboto1Error
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 09:51032,573,69418,924,0004,196,00020,480Exit with code 1: A nz=4000000 zero=0 one=0 two=0 le4=0 le16=0 ff=0 min=3263 max=4294966563 sum=8591510552804996 row_min=2000 row_max=2000 B nz=4000000 zero=0 one=0 two=0 le4=0 le16=0 ff=0 min=483 max=4294965452 sum=8591021359732251 row_min=2000 row_ma...stderr