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 listJul 29, 2026 23:41anboto1anboto1Score: 3,474Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 23:423,457528,536,986492,912,00025,645,00016,793,600
2Jul 29, 2026 23:423,466529,977,826494,577,00025,453,00016,793,600
3Jul 29, 2026 23:423,470530,528,955494,718,00025,798,00016,793,600
4Jul 29, 2026 23:423,472530,873,916495,252,00025,639,00016,793,600
5Jul 29, 2026 23:423,474531,202,554495,551,00025,669,00016,793,600
6Jul 29, 2026 23:423,474531,192,848495,241,00025,929,00016,793,600
7Jul 29, 2026 23:423,475531,426,988495,411,00025,948,00016,793,600
8Jul 29, 2026 23:423,478531,822,420496,197,00025,597,00016,793,600
9Jul 29, 2026 23:423,488533,258,363498,155,00025,153,00016,793,600