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:33A_ShamanA_ShamanScore: 4,016Success
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:344,010610,992,350575,654,00025,944,00016,793,600
2Jul 2, 2026 10:344,011611,614,509575,397,00026,297,00016,793,600
3Jul 2, 2026 10:344,012611,248,894576,138,00025,698,00016,793,600
4Jul 2, 2026 10:344,013611,440,627575,730,00026,357,00016,793,600
5Jul 2, 2026 10:344,016611,778,020576,641,00025,780,00016,793,600
6Jul 2, 2026 10:344,018612,228,926576,228,00026,574,00016,793,600
7Jul 2, 2026 10:344,018613,450,252576,100,00026,635,00016,793,600
8Jul 2, 2026 10:344,045616,268,259580,036,00026,738,00016,793,600
9Jul 2, 2026 10:344,050617,002,393581,705,00025,885,00016,793,600