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 listMay 7, 2026 01:46olliecrowolliecrowScore: 3,404Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 01:463,401526,728,539507,033,0003,194,00017,088,512
2May 7, 2026 01:463,401527,284,769506,992,0003,256,00016,986,112
3May 7, 2026 01:463,401528,322,973507,021,0003,216,00017,166,336
4May 7, 2026 01:463,402527,666,466507,136,0003,183,00016,990,208
5May 7, 2026 01:463,404525,658,612507,523,0003,119,00017,092,608
6May 7, 2026 01:463,404527,816,947507,376,0003,343,00017,010,688
7May 7, 2026 01:463,404525,446,867507,515,0003,157,00017,223,680
8May 7, 2026 01:463,405529,077,295507,738,0003,140,00017,055,744
9May 7, 2026 01:463,406528,326,846507,755,0003,181,00017,031,168