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 25, 2026 23:51Charles CabergsCharles CabergsScore: 3,904Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 23:513,900601,871,189576,112,0009,001,00017,100,800
2Apr 25, 2026 23:513,901599,512,368577,172,0008,002,00017,092,608
3Apr 25, 2026 23:513,902600,877,499575,333,00010,005,00017,084,416
4Apr 25, 2026 23:513,903602,337,403576,508,0008,992,00017,100,800
5Apr 25, 2026 23:513,904601,853,768576,746,0008,996,00017,092,608
6Apr 25, 2026 23:513,905613,427,243575,772,0009,996,00016,990,208
7Apr 25, 2026 23:513,908605,985,281577,269,0009,004,00017,104,896
8Apr 25, 2026 23:513,909604,619,338575,394,00010,988,00016,990,208
9Apr 25, 2026 23:513,913607,415,152578,038,0009,000,00017,108,992