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 listApr 26, 2026 00:14olliecrowolliecrowScore: 3,214Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 00:153,205500,168,403473,804,0006,997,00017,002,496
2Apr 26, 2026 00:153,208501,073,454476,330,0005,003,00016,994,304
3Apr 26, 2026 00:153,208499,688,576476,236,0005,002,00017,002,496
4Apr 26, 2026 00:153,214503,001,177478,237,0004,001,00017,248,256
5Apr 26, 2026 00:153,214494,939,675476,168,0006,002,00017,240,064
6Apr 26, 2026 00:153,216497,975,253476,488,0005,993,00016,994,304
7Apr 26, 2026 00:153,217500,715,879475,623,0006,994,00016,994,304
8Apr 26, 2026 00:153,217504,019,362477,621,0004,996,00017,248,256
9Apr 26, 2026 00:153,854596,983,933573,120,0005,001,00016,990,208