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 26, 2026 20:13A_ShamanA_ShamanScore: 4,036Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 20:144,025612,965,182577,648,00026,186,00016,793,600
2Jun 26, 2026 20:144,033614,420,412577,364,00027,709,00016,793,600
3Jun 26, 2026 20:144,033614,233,627577,266,00027,711,00016,793,600
4Jun 26, 2026 20:144,033614,187,615577,656,00027,352,00016,793,600
5Jun 26, 2026 20:144,036614,666,953578,565,00026,893,00016,793,600
6Jun 26, 2026 20:144,037614,888,871578,014,00027,537,00016,793,600
7Jun 26, 2026 20:144,040615,325,187579,189,00026,929,00016,793,600
8Jun 26, 2026 20:144,045616,026,682579,238,00027,575,00016,793,600
9Jun 26, 2026 20:144,056617,634,598580,790,00027,653,00016,793,600