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 18, 2026 12:29Victor MerckléVictor MerckléScore: 1,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 12:301,653257,185,901240,105,0007,909,00016,797,696
2Jun 18, 2026 12:301,653257,292,726240,158,0007,871,00016,797,696
3Jun 18, 2026 12:301,654257,379,561240,316,0007,917,00016,797,696
4Jun 18, 2026 12:301,654257,240,215240,298,0007,814,00016,797,696
5Jun 18, 2026 12:301,654257,347,609240,342,0007,839,00016,797,696
6Jun 18, 2026 12:301,655257,402,710240,199,0008,086,00016,797,696
7Jun 18, 2026 12:301,658257,968,686240,875,0007,904,00016,797,696
8Jun 18, 2026 12:301,659258,102,915241,011,0007,954,00016,797,696
9Jun 18, 2026 12:301,660258,273,327241,088,0007,930,00016,797,696