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 15, 2026 15:59Tomislav TunkovicTomislav TunkovicScore: 1,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 15:591,677262,434,406241,929,0009,631,00016,027,648stderr
2Aug 15, 2026 15:591,682262,379,914242,828,0009,496,00016,027,648stderr
3Aug 15, 2026 15:591,683262,527,907243,260,0009,282,00016,027,648stderr
4Aug 15, 2026 15:591,684263,290,868242,962,0009,643,00016,027,648stderr
5Aug 15, 2026 15:591,686263,770,578243,393,0009,596,00016,027,648stderr
6Aug 15, 2026 15:591,687263,963,208243,595,0009,487,00016,027,648stderr
7Aug 15, 2026 15:591,687263,209,378243,389,0009,717,00016,027,648stderr
8Aug 15, 2026 15:591,688264,063,905243,550,0009,683,00016,027,648stderr
9Aug 15, 2026 15:591,762286,229,476254,863,0009,493,00016,027,648stderr