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 listJun 24, 2026 09:45anboto1anboto1Score: 5,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 09:455,405820,070,697785,512,00025,322,00016,793,600
2Jun 24, 2026 09:455,454827,334,029791,841,00026,383,00016,793,600
3Jun 24, 2026 09:455,460828,197,693793,159,00025,908,00016,793,600
4Jun 24, 2026 09:455,468830,863,216794,405,00025,864,00016,793,600
5Jun 24, 2026 09:455,469829,579,669793,797,00026,676,00016,793,600
6Jun 24, 2026 09:455,476830,633,873794,697,00026,713,00016,793,600
7Jun 24, 2026 09:455,485832,025,676795,795,00027,023,00016,793,600
8Jun 24, 2026 09:455,485832,017,229796,000,00026,797,00016,793,600
9Jun 24, 2026 09:455,490832,817,820796,720,00026,801,00016,793,600