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 27, 2026 23:22Dominique GarmierDominique GarmierScore: 3,475Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 23:223,469550,908,810493,308,00027,016,00017,203,200
2Mar 27, 2026 23:223,470548,705,693500,578,00019,983,00017,162,240
3Mar 27, 2026 23:223,471550,105,009497,680,00022,985,00017,149,952
4Mar 27, 2026 23:223,473544,952,248494,984,00025,999,00017,006,592
5Mar 27, 2026 23:223,475552,209,334498,253,00023,011,00017,145,856
6Mar 27, 2026 23:223,477554,548,423498,520,00022,977,00017,018,880
7Mar 27, 2026 23:223,479547,530,714500,910,00020,996,00017,166,336
8Mar 27, 2026 23:223,500549,361,489499,939,00024,996,00016,953,344
9Mar 27, 2026 23:223,532555,425,302505,787,00023,989,00017,170,432