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 21, 2026 17:45A_ShamanA_ShamanScore: 4,679Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 17:464,671710,105,848669,463,00031,301,00016,805,888
2Jun 21, 2026 17:464,673710,884,545670,311,00030,655,00016,805,888
3Jun 21, 2026 17:464,675711,824,361671,812,00029,571,00016,805,888
4Jun 21, 2026 17:464,678711,473,591670,935,00030,793,00016,805,888
5Jun 21, 2026 17:464,679711,684,803671,803,00030,096,00016,805,888
6Jun 21, 2026 17:464,679711,767,514671,264,00030,732,00016,805,888
7Jun 21, 2026 17:464,699714,278,539673,923,00030,998,00016,805,888
8Jun 21, 2026 17:464,701714,889,166674,827,00030,389,00016,805,888
9Jun 21, 2026 17:464,704715,333,085675,765,00029,842,00016,805,888