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 24, 2026 11:52anboto1anboto1Score: 3,233Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 11:533,226493,232,123459,251,00024,656,00016,793,600
2Jun 24, 2026 11:533,229493,722,315459,671,00024,817,00016,793,600
3Jun 24, 2026 11:533,230493,732,813459,886,00024,629,00016,793,600
4Jun 24, 2026 11:533,233494,161,222459,503,00025,507,00016,793,600
5Jun 24, 2026 11:533,233494,113,507459,352,00025,742,00016,793,600
6Jun 24, 2026 11:533,235494,594,960459,246,00026,121,00016,793,600
7Jun 24, 2026 11:533,242495,548,487461,999,00024,401,00016,793,600
8Jun 24, 2026 11:533,244495,784,159461,198,00025,419,00016,793,600
9Jun 24, 2026 11:533,247496,208,974461,941,00025,118,00016,793,600