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 listJul 24, 2026 06:49Kasper KivimäkiKasper KivimäkiScore: 5,315Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2026 06:505,307805,900,557768,816,00027,357,00016,793,600
2Jul 24, 2026 06:505,308806,006,162768,608,00027,671,00016,793,600
3Jul 24, 2026 06:505,308806,031,753768,954,00027,319,00016,793,600
4Jul 24, 2026 06:505,315807,193,209769,225,00028,110,00016,793,600
5Jul 24, 2026 06:505,315807,286,927770,205,00027,151,00016,793,600
6Jul 24, 2026 06:505,325808,542,032772,070,00026,731,00016,793,600
7Jul 24, 2026 06:505,331809,451,276772,045,00027,644,00016,793,600
8Jul 24, 2026 06:505,333809,846,491772,169,00027,857,00016,793,600
9Jul 24, 2026 06:505,348812,203,417773,794,00028,514,00016,793,600