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 listJun 26, 2026 20:18A_ShamanA_ShamanScore: 4,023Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 20:184,016611,645,491575,773,00026,709,00016,793,600
2Jun 26, 2026 20:184,017611,828,209575,304,00027,301,00016,793,600
3Jun 26, 2026 20:184,021615,482,546576,326,00026,938,00016,793,600
4Jun 26, 2026 20:184,021612,334,935576,028,00027,132,00016,793,600
5Jun 26, 2026 20:184,023612,750,024576,604,00026,885,00016,793,600
6Jun 26, 2026 20:184,026613,107,057576,255,00027,671,00016,793,600
7Jun 26, 2026 20:184,026613,136,555576,340,00027,632,00016,793,600
8Jun 26, 2026 20:184,030613,861,460577,137,00027,446,00016,793,600
9Jun 26, 2026 20:184,030613,841,959577,323,00027,255,00016,793,600