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 listApr 30, 2026 19:30Charles CabergsCharles CabergsScore: 3,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 19:313,803586,823,972565,593,0004,996,00017,010,688
2Apr 30, 2026 19:313,803589,300,069564,593,0005,995,00017,211,392
3Apr 30, 2026 19:313,804589,935,569564,731,0005,997,00017,211,392
4Apr 30, 2026 19:313,805591,848,422564,894,0005,998,00017,207,296
5Apr 30, 2026 19:313,806587,528,632566,021,0005,000,00017,211,392
6Apr 30, 2026 19:313,806589,416,280565,961,0004,999,00017,010,688
7Apr 30, 2026 19:313,806590,776,296564,927,0005,999,00017,215,488
8Apr 30, 2026 19:313,810592,231,925565,507,0005,994,00017,207,296
9Apr 30, 2026 19:313,811591,037,646565,700,0005,996,00017,207,296