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 listMay 13, 2026 21:17Aleksei ShahoikaAleksei ShahoikaScore: 13,615Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 21:1812,9141,946,709,1101,913,181,00024,029,00016,793,600
2May 13, 2026 21:1813,4982,033,895,2281,998,846,00025,985,00016,793,600
3May 13, 2026 21:1813,5372,040,509,4082,003,872,00026,714,00016,793,600
4May 13, 2026 21:1813,5392,042,758,4892,005,159,00025,776,00016,793,600
5May 13, 2026 21:1813,6152,052,413,9962,015,951,00026,407,00016,793,600
6May 13, 2026 21:1813,7162,068,919,9962,030,252,00027,187,00016,793,600
7May 13, 2026 21:1813,7192,066,873,6952,031,994,00025,952,00016,793,600
8May 13, 2026 21:1813,7972,080,256,8592,043,876,00025,696,00016,793,600
9May 13, 2026 21:1815,4942,333,025,8772,298,420,00025,817,00016,793,600