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 12:04anboto1anboto1Score: 3,749Success
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 12:043,741570,447,425532,417,00028,857,00016,793,600
2Jun 24, 2026 12:043,746571,169,081533,204,00028,755,00016,793,600
3Jun 24, 2026 12:043,747571,327,101533,871,00028,251,00016,793,600
4Jun 24, 2026 12:043,747571,342,080532,987,00029,183,00016,793,600
5Jun 24, 2026 12:043,749571,738,803533,460,00028,953,00016,793,600
6Jun 24, 2026 12:043,750571,789,479533,521,00029,064,00016,793,600
7Jun 24, 2026 12:043,757572,721,782533,970,00029,694,00016,793,600
8Jun 24, 2026 12:043,777575,749,635537,502,00029,060,00016,793,600
9Jun 24, 2026 12:043,784576,894,507538,313,00029,337,00016,793,600