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 listAug 16, 2026 23:09Tomislav TunkovicTomislav TunkovicScore: 31,391Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 02:5931,3594,713,178,4544,683,146,00020,796,00016,818,176
2Aug 17, 2026 02:5931,3774,715,901,6194,686,093,00020,532,00016,818,176
3Aug 17, 2026 02:5931,3794,716,033,9414,686,247,00020,660,00016,818,176
4Aug 17, 2026 02:5931,3864,717,194,0774,687,247,00020,726,00016,818,176
5Aug 17, 2026 02:5931,3914,718,514,9294,687,859,00020,810,00016,818,176
6Aug 17, 2026 02:5931,3954,718,632,9514,688,652,00020,684,00016,818,176
7Aug 17, 2026 02:5931,3974,718,957,9834,688,671,00020,925,00016,818,176
8Aug 17, 2026 02:5931,3984,719,257,8234,688,180,00021,573,00016,818,176
9Aug 17, 2026 02:5931,4074,720,331,1634,690,309,00020,843,00016,818,176