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 19, 2026 12:31Victor MerckléVictor MerckléScore: 1,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 12:331,648257,606,189239,404,0007,864,00016,797,696
2Jun 19, 2026 12:331,649256,463,784239,484,0007,879,00016,797,696
3Jun 19, 2026 12:331,649256,532,415239,459,0007,901,00016,797,696
4Jun 19, 2026 12:331,650256,836,048239,668,0007,976,00016,797,696
5Jun 19, 2026 12:331,650257,018,937239,612,0007,912,00016,797,696
6Jun 19, 2026 12:331,651256,900,113239,833,0007,950,00016,797,696
7Jun 19, 2026 12:331,653257,156,376240,056,0007,926,00016,797,696
8Jun 19, 2026 12:331,654257,372,333240,234,0007,968,00016,797,696
9Jun 19, 2026 12:331,655257,500,879240,399,0007,981,00016,797,696