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 listApr 28, 2026 08:25TudyMTudyMScore: 5,734Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 08:275,629860,130,560812,452,00031,978,00017,145,856
2Apr 28, 2026 08:275,686872,311,583816,008,00036,955,00017,141,760
3Apr 28, 2026 08:275,713875,218,644820,102,00036,959,00017,227,776
4Apr 28, 2026 08:275,718875,560,446820,716,00036,987,00017,149,952
5Apr 28, 2026 08:275,734878,225,451816,197,00043,956,00017,145,856
6Apr 28, 2026 08:275,754884,089,920827,163,00035,963,00017,145,856
7Apr 28, 2026 08:275,764886,660,300831,632,00032,985,00017,121,280
8Apr 28, 2026 08:275,771885,756,655830,782,00034,990,00017,145,856
9Apr 28, 2026 08:275,800886,951,386838,140,00031,967,00017,219,584