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 13, 2026 02:24Victor MerckléVictor MerckléScore: 1,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 02:271,689262,479,273244,948,0008,467,00016,814,080
2Jun 13, 2026 02:271,689262,426,556245,077,0008,379,00016,809,984
3Jun 13, 2026 02:271,689262,448,609244,023,0009,347,00016,936,960
4Jun 13, 2026 02:271,690262,669,418245,204,0008,381,00016,814,080
5Jun 13, 2026 02:271,690262,552,967245,034,0008,466,00016,809,984
6Jun 13, 2026 02:271,691262,854,303245,274,0008,486,00016,814,080
7Jun 13, 2026 02:271,693263,064,101245,621,0008,441,00016,814,080
8Jun 13, 2026 02:271,694263,250,104245,733,0008,472,00016,809,984
9Jun 13, 2026 02:271,695266,125,060244,804,0009,508,00016,936,960