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 listJun 24, 2026 10:14anboto1anboto1Score: 5,309Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 10:155,281801,372,964764,513,00027,702,00016,793,600
2Jun 24, 2026 10:155,288802,442,421765,421,00027,816,00016,793,600
3Jun 24, 2026 10:155,288802,525,038765,810,00027,501,00016,793,600
4Jun 24, 2026 10:155,307805,315,884768,919,00027,228,00016,793,600
5Jun 24, 2026 10:155,309805,780,286769,329,00027,166,00016,793,600
6Jun 24, 2026 10:155,316806,660,189769,861,00027,590,00016,793,600
7Jun 24, 2026 10:155,317807,049,389769,567,00028,029,00016,793,600
8Jun 24, 2026 10:155,369814,571,493778,403,00026,988,00016,793,600
9Jun 24, 2026 10:155,444825,857,221789,389,00027,293,00016,793,600