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 listApr 29, 2026 04:44olliecrowolliecrowScore: 3,188Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 04:473,184498,219,115471,713,0005,996,00017,096,704
2Apr 29, 2026 04:473,185494,595,528471,862,0005,998,00017,051,648
3Apr 29, 2026 04:473,187486,840,541472,172,0006,002,00017,145,856
4Apr 29, 2026 04:473,188486,914,312473,234,0005,002,00017,010,688
5Apr 29, 2026 04:473,188486,846,089473,271,0005,002,00017,039,360
6Apr 29, 2026 04:473,190487,268,099473,577,0004,995,00017,035,264
7Apr 29, 2026 04:473,194487,596,462473,177,0006,002,00017,137,664
8Apr 29, 2026 04:473,196488,150,320472,539,0006,993,00017,059,840
9Apr 29, 2026 04:473,201488,694,788476,144,0004,009,00017,137,664