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 12, 2026 07:22Victor MerckléVictor MerckléScore: 1,696Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 07:231,694263,310,100246,527,0007,642,00016,797,696
2Jun 12, 2026 07:231,695263,763,715246,553,0007,735,00016,797,696
3Jun 12, 2026 07:231,695263,443,124246,563,0007,753,00016,797,696
4Jun 12, 2026 07:231,696263,978,742246,708,0007,775,00016,797,696
5Jun 12, 2026 07:231,696263,721,550246,656,0007,838,00016,797,696
6Jun 12, 2026 07:231,697264,037,012246,825,0007,777,00016,797,696
7Jun 12, 2026 07:231,700264,228,335247,288,0007,826,00016,797,696
8Jun 12, 2026 07:231,701264,717,114247,430,0007,829,00016,797,696
9Jun 12, 2026 07:231,702264,532,860247,526,0007,847,00016,797,696