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 22, 2026 22:59M-RochatM-RochatScore: 6,771Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 23:006,7571,023,398,685992,432,00021,219,00016,793,600
2May 22, 2026 23:006,7621,026,289,029992,827,00021,570,00016,793,600
3May 22, 2026 23:006,7681,026,360,448993,754,00021,529,00016,793,600
4May 22, 2026 23:006,7701,024,951,534993,816,00021,695,00016,793,600
5May 22, 2026 23:006,7711,026,727,712994,189,00021,559,00016,793,600
6May 22, 2026 23:006,7711,026,347,012994,268,00021,462,00016,793,600
7May 22, 2026 23:006,7721,027,195,463994,736,00021,171,00016,793,600
8May 22, 2026 23:006,7751,026,568,764994,860,00021,538,00016,793,600
9May 22, 2026 23:006,7941,028,654,600997,977,00021,135,00016,793,600