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 listJul 29, 2026 17:20anboto1anboto1Score: 3,050Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 17:213,047467,115,131448,572,0008,627,00016,793,600
2Jul 29, 2026 17:213,049467,563,197448,635,0008,852,00016,793,600
3Jul 29, 2026 17:213,050467,548,283448,859,0008,689,00016,793,600
4Jul 29, 2026 17:213,050467,567,293448,913,0008,670,00016,793,600
5Jul 29, 2026 17:213,050468,151,326448,797,0008,744,00016,793,600
6Jul 29, 2026 17:213,051467,722,615448,953,0008,771,00016,793,600
7Jul 29, 2026 17:213,055468,133,575449,562,0008,733,00016,793,600
8Jul 29, 2026 17:213,056468,497,722449,857,0008,687,00016,793,600
9Jul 29, 2026 17:213,060469,065,113450,414,0008,709,00016,793,600