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 5, 2026 00:45Victor MerckléVictor MerckléScore: 1,826Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 00:461,824282,772,971266,691,0006,985,00016,797,696
2Jun 5, 2026 00:461,825282,887,695266,783,0007,018,00016,797,696
3Jun 5, 2026 00:461,825282,901,408266,749,0007,031,00016,797,696
4Jun 5, 2026 00:461,826283,048,622266,871,0007,103,00016,797,696
5Jun 5, 2026 00:461,826283,105,825266,867,0007,099,00016,797,696
6Jun 5, 2026 00:461,826283,034,646266,919,0006,986,00016,797,696
7Jun 5, 2026 00:461,830283,586,573267,486,0007,076,00016,797,696
8Jun 5, 2026 00:461,831283,769,444267,696,0007,021,00016,797,696
9Jun 5, 2026 00:461,832283,973,982267,778,0007,069,00016,797,696