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 listFeb 16, 2026 18:26Valentin KofmanValentin KofmanScore: 3,971Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 18:263,970624,975,430587,492,0007,993,00017,178,624
2Feb 16, 2026 18:263,971620,861,741584,640,00010,993,00016,977,920
3Feb 16, 2026 18:263,978624,248,305585,717,00010,994,00017,014,784