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 listMar 4, 2026 20:16olliecrowolliecrowScore: 3,712Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 20:163,710579,965,937527,586,00028,977,00017,149,952
2Mar 4, 2026 20:163,711584,721,596520,610,00035,973,00016,969,728
3Mar 4, 2026 20:163,711584,268,067527,610,00028,978,00017,129,472
4Mar 4, 2026 20:163,712585,507,439522,794,00033,986,00016,969,728
5Mar 4, 2026 20:163,712582,967,080527,867,00028,992,00017,002,496
6Mar 4, 2026 20:163,716585,058,608527,496,00029,971,00016,969,728
7Mar 4, 2026 20:163,717586,089,374525,517,00031,970,00016,973,824
8Mar 4, 2026 20:163,717583,172,982531,622,00025,981,00017,035,264
9Mar 4, 2026 20:163,720584,333,099528,019,00030,001,00017,158,144