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 17, 2026 08:22M-RochatM-RochatScore: 4,136Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 08:284,114625,946,472596,308,00020,845,00016,793,600
2May 17, 2026 08:284,130628,267,497598,390,00021,249,00016,793,600
3May 17, 2026 08:284,135629,699,439599,019,00021,314,00016,793,600
4May 17, 2026 08:284,135629,712,742599,137,00021,115,00016,793,600
5May 17, 2026 08:284,136631,241,369599,415,00021,119,00016,793,600
6May 17, 2026 08:284,136630,502,374599,167,00021,245,00016,793,600
7May 17, 2026 08:284,147632,516,866601,197,00020,950,00016,793,600
8May 17, 2026 08:284,171635,495,448604,822,00020,975,00016,793,600
9May 17, 2026 08:284,187639,081,240607,181,00020,944,00016,793,600