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 listMay 4, 2026 13:34Victor MerckléVictor MerckléScore: 1,829Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 13:351,826291,282,321267,014,0006,887,00017,145,856
2May 4, 2026 13:351,826292,572,389267,139,0006,863,00017,158,144
3May 4, 2026 13:351,827292,467,836267,110,0006,964,00017,141,760
4May 4, 2026 13:351,829290,313,686267,453,0006,902,00017,145,856
5May 4, 2026 13:351,829293,680,266267,584,0006,884,00017,149,952
6May 4, 2026 13:351,829293,800,664267,368,0007,099,00017,149,952
7May 4, 2026 13:351,829291,997,832267,477,0006,877,00017,149,952
8May 4, 2026 13:351,829292,605,122267,562,0006,840,00017,145,856
9May 4, 2026 13:351,832293,494,155267,984,0006,895,00017,149,952