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 listJun 24, 2026 10:55anboto1anboto1Score: 20,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 10:5620,7453,120,961,5233,091,331,00020,461,00016,793,600
2Jun 24, 2026 10:5620,8983,144,163,8773,113,688,00021,083,00016,793,600
3Jun 24, 2026 10:5620,9393,150,037,5933,120,021,00020,844,00016,793,600
4Jun 24, 2026 10:5620,9503,151,737,1503,121,744,00020,838,00016,793,600
5Jun 24, 2026 10:5620,9703,154,815,0053,124,707,00020,937,00016,793,600
6Jun 24, 2026 10:5620,9903,157,742,5313,127,784,00020,807,00016,793,600
7Jun 24, 2026 10:5621,1483,181,496,7943,151,564,00020,690,00016,793,600
8Jun 24, 2026 10:5623,5523,542,377,5423,511,000,00021,864,00016,793,600
9Jun 24, 2026 10:5623,6763,560,791,7563,529,979,00021,509,00016,793,600