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 listMar 4, 2026 20:25olliecrowolliecrowScore: 3,711Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 20:253,709585,346,581524,293,00032,017,00017,154,048
2Mar 4, 2026 20:253,710587,314,955525,469,00030,968,00016,969,728
3Mar 4, 2026 20:253,710597,720,526525,483,00030,969,00017,154,048
4Mar 4, 2026 20:253,711579,555,537525,655,00030,979,00017,080,320
5Mar 4, 2026 20:253,711577,408,200531,736,00024,987,00016,965,632
6Mar 4, 2026 20:253,712582,944,259531,868,00024,993,00016,986,112
7Mar 4, 2026 20:253,718586,750,865520,780,00036,984,00017,051,648
8Mar 4, 2026 20:253,720586,967,253532,997,00024,999,00017,031,168
9Mar 4, 2026 20:253,720593,187,599527,006,00031,000,00016,953,344