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 2, 2026 10:57A_ShamanA_ShamanScore: 3,963Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 10:593,958604,749,975571,934,00021,893,00016,793,600
2Jul 2, 2026 10:593,960603,498,985571,854,00022,171,00016,793,600
3Jul 2, 2026 10:593,963603,877,473572,285,00022,252,00016,793,600
4Jul 2, 2026 10:593,963603,838,382572,604,00021,868,00016,793,600
5Jul 2, 2026 10:593,963603,861,953572,645,00021,885,00016,793,600
6Jul 2, 2026 10:593,963603,878,476572,275,00022,207,00016,793,600
7Jul 2, 2026 10:593,969604,955,150573,345,00022,129,00016,793,600
8Jul 2, 2026 10:593,974605,567,713574,237,00021,951,00016,793,600
9Jul 2, 2026 10:594,012611,292,062578,446,00023,413,00016,793,600