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 27, 2026 18:32Victor MerckléVictor MerckléScore: 1,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 18:331,662256,926,144241,600,0007,769,00016,797,696
2Jun 27, 2026 18:331,662256,886,676241,603,0007,722,00016,797,696
3Jun 27, 2026 18:331,663257,171,470241,786,0007,790,00016,797,696
4Jun 27, 2026 18:331,663257,168,562241,766,0007,785,00016,797,696
5Jun 27, 2026 18:331,664257,314,946241,708,0007,944,00016,797,696
6Jun 27, 2026 18:331,664257,190,028241,829,0007,814,00016,797,696
7Jun 27, 2026 18:331,668257,808,335242,413,0007,874,00016,797,696
8Jun 27, 2026 18:331,669257,999,043242,507,0007,877,00016,797,696
9Jun 27, 2026 18:331,669258,060,620242,549,0007,915,00016,797,696