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 listSep 15, 2026 16:03Haha ExpertHaha ExpertScore: 5,190Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 16:095,168785,575,804765,638,0009,660,00016,793,600
2Sep 15, 2026 16:095,170785,966,300766,083,0009,498,00016,793,600
3Sep 15, 2026 16:095,178787,109,073767,252,0009,593,00016,793,600
4Sep 15, 2026 16:095,190789,058,984768,781,0009,808,00016,793,600
5Sep 15, 2026 16:095,190788,930,981769,045,0009,552,00016,793,600
6Sep 15, 2026 16:095,195789,668,807769,821,0009,535,00016,793,600
7Sep 15, 2026 16:095,210791,958,023772,197,0009,446,00016,793,600
8Sep 15, 2026 16:095,211792,004,480772,081,0009,618,00016,793,600
9Sep 15, 2026 16:095,223793,784,857774,046,0009,489,00016,793,600