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 listJul 29, 2026 20:11anboto1anboto1Score: 22,499Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 20:1221,4133,222,262,9893,185,782,00026,181,00016,793,600
2Jul 29, 2026 20:1222,2593,349,045,2263,312,959,00026,019,00016,793,600
3Jul 29, 2026 20:1222,3213,358,426,5233,321,505,00026,670,00016,793,600
4Jul 29, 2026 20:1222,4193,372,978,8983,337,082,00025,830,00016,793,600
5Jul 29, 2026 20:1222,4993,384,962,0103,348,263,00026,676,00016,793,600
6Jul 29, 2026 20:1222,5343,390,332,9723,353,429,00026,793,00016,793,600
7Jul 29, 2026 20:1222,5523,393,050,1563,356,162,00026,778,00016,793,600
8Jul 29, 2026 20:1223,3553,513,462,1373,476,236,00027,028,00016,793,600
9Jul 29, 2026 20:1225,3223,808,576,3123,772,715,00025,636,00016,793,600