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 listOct 21, 2026 03:55e1011e1011Score: 19,345Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 03:5619,2472,898,596,4882,862,200,00024,972,00016,793,600
2Oct 21, 2026 03:5619,2582,899,920,4552,863,337,00025,455,00016,793,600
3Oct 21, 2026 03:5619,2792,903,452,8092,866,617,00025,360,00016,793,600
4Oct 21, 2026 03:5619,3212,912,397,8092,873,118,00025,149,00016,793,600
5Oct 21, 2026 03:5619,3452,912,643,0002,876,262,00025,512,00016,793,600
6Oct 21, 2026 03:5619,3842,918,698,7842,881,782,00025,944,00016,793,600
7Oct 21, 2026 03:5619,3952,920,280,9592,884,144,00025,235,00016,793,600
8Oct 21, 2026 03:5619,3992,920,470,5582,884,798,00025,140,00016,793,600
9Oct 21, 2026 03:5619,5792,958,186,6052,910,623,00026,258,00016,793,600