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 listJan 1, 2026 00:26Josu San MartinJosu San MartinScore: 4,047Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 00:264,037632,175,931580,498,00024,978,00017,084,416
2Jan 1, 2026 00:264,041635,089,737581,209,00025,009,00017,031,168
3Jan 1, 2026 00:264,043641,776,082582,491,00023,979,00017,076,224
4Jan 1, 2026 00:264,045637,313,785584,760,00021,990,00016,961,536
5Jan 1, 2026 00:264,047634,565,910583,020,00024,000,00016,953,344
6Jan 1, 2026 00:264,065632,705,445585,772,00023,990,00017,080,320
7Jan 1, 2026 00:264,066634,926,353585,873,00023,994,00017,022,976
8Jan 1, 2026 00:264,069641,787,403587,420,00022,977,00017,059,840
9Jan 1, 2026 00:264,073636,382,819585,931,00024,997,00017,121,280