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 listJan 8, 2026 19:599999199991Score: 3,752Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 19:593,745587,259,696511,754,00049,976,00017,207,296
2Jan 8, 2026 19:593,749592,246,513503,430,00058,933,00017,068,032
3Jan 8, 2026 19:593,750587,981,496517,534,00044,959,00017,125,376
4Jan 8, 2026 19:593,750593,705,074512,541,00049,955,00017,072,128
5Jan 8, 2026 19:593,752590,028,342503,867,00058,984,00016,949,248
6Jan 8, 2026 19:593,752586,451,822513,866,00048,987,00016,953,344
7Jan 8, 2026 19:593,753589,018,848508,920,00053,991,00017,059,840
8Jan 8, 2026 19:593,754589,699,252506,064,00057,007,00017,186,816
9Jan 8, 2026 19:593,754597,513,813497,070,00066,009,00017,068,032