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 20:28anboto1anboto1Score: 4,988Success
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 20:284,957753,643,659722,696,00020,948,00016,793,600
2Jul 29, 2026 20:284,960753,939,002723,259,00020,774,00016,793,600
3Jul 29, 2026 20:284,980756,986,490726,124,00020,987,00016,793,600
4Jul 29, 2026 20:284,985757,733,892727,227,00020,661,00016,793,600
5Jul 29, 2026 20:284,988758,191,567727,587,00020,627,00016,793,600
6Jul 29, 2026 20:284,991758,703,671727,735,00020,991,00016,793,600
7Jul 29, 2026 20:285,012761,881,412730,903,00020,931,00016,793,600
8Jul 29, 2026 20:285,089773,459,221742,448,00021,051,00016,793,600
9Jul 29, 2026 20:285,358813,905,629782,409,00021,392,00016,793,600