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 listOct 9, 2026 08:15Karthik ReddyKarthik ReddyScore: 1,555Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 09:051,553244,326,291227,904,0005,166,00016,793,600
2Oct 9, 2026 09:051,554242,262,981228,004,0005,195,00016,793,600
3Oct 9, 2026 09:051,554242,006,403228,846,0004,259,00016,793,600
4Oct 9, 2026 09:051,555242,305,022228,891,0004,450,00016,793,600
5Oct 9, 2026 09:051,555242,403,429228,999,0004,265,00016,793,600
6Oct 9, 2026 09:051,555242,329,253229,076,0004,323,00016,793,600
7Oct 9, 2026 09:051,557242,562,553229,364,0004,306,00016,793,600
8Oct 9, 2026 09:051,565245,400,613229,475,0005,281,00016,793,600
9Oct 9, 2026 09:051,570244,596,791231,223,0004,335,00016,793,600