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 29, 2026 23:12anboto1anboto1Score: 2,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 23:142,966455,079,008430,044,00014,959,00016,793,600
2Jul 29, 2026 23:142,967455,558,527430,150,00015,034,00016,793,600
3Jul 29, 2026 23:142,967455,005,227429,968,00015,085,00016,793,600
4Jul 29, 2026 23:142,968455,338,375430,298,00015,051,00016,793,600
5Jul 29, 2026 23:142,970455,634,539430,554,00015,010,00016,793,600
6Jul 29, 2026 23:142,970455,512,163430,669,00014,941,00016,793,600
7Jul 29, 2026 23:142,973455,808,718430,867,00015,096,00016,793,600
8Jul 29, 2026 23:142,974456,192,958431,111,00015,116,00016,793,600
9Jul 29, 2026 23:142,980456,891,453431,899,00015,126,00016,793,600