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 5, 2026 03:55Josu San MartinJosu San MartinScore: 3,273Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 03:553,252512,899,497448,854,00038,987,00017,014,784
2Jan 5, 2026 03:563,259512,096,212447,827,00040,984,00016,969,728
3Jan 5, 2026 03:553,261516,104,276445,139,00044,013,00016,965,632
4Jan 5, 2026 03:553,263518,157,158448,454,00040,950,00017,182,720
5Jan 5, 2026 03:563,263518,400,928447,507,00041,953,00017,068,032
6Jan 5, 2026 03:553,267518,271,790449,060,00041,005,00017,076,224
7Jan 5, 2026 03:553,273514,147,664451,940,00038,994,00017,035,264
8Jan 5, 2026 03:563,274516,760,879449,091,00042,008,00016,969,728
9Jan 5, 2026 03:553,275519,391,028449,321,00041,936,00017,080,320
10Jan 5, 2026 03:553,276519,532,199450,421,00040,947,00017,076,224
11Jan 5, 2026 03:553,276514,239,010456,420,00034,955,00017,068,032
12Jan 5, 2026 03:553,287519,996,442456,076,00037,006,00017,088,512