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 listOct 21, 2026 06:06e1011e1011Score: 56,221Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 06:1056,1868,439,408,4948,411,312,00016,737,00016,793,600
2Oct 21, 2026 06:1056,1878,439,140,5038,411,444,00016,700,00016,793,600
3Oct 21, 2026 06:1056,1898,439,361,0638,411,518,00016,870,00016,793,600
4Oct 21, 2026 06:1056,1958,440,788,2418,411,267,00018,062,00016,793,600
5Oct 21, 2026 06:1056,2218,444,148,0978,416,447,00016,764,00016,793,600
6Oct 21, 2026 06:1056,2278,445,104,4998,417,185,00016,985,00016,793,600
7Oct 21, 2026 06:1056,2288,445,169,5218,417,391,00016,821,00016,793,600
8Oct 21, 2026 06:1056,2318,445,902,5668,417,672,00016,984,00016,793,600
9Oct 21, 2026 06:1056,2348,446,797,6418,417,686,00017,487,00016,793,600