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: 3,056Success
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:143,055468,391,999443,148,00015,110,00016,793,600
2Jul 29, 2026 23:143,055468,302,935443,473,00014,910,00016,793,600
3Jul 29, 2026 23:143,055468,908,242442,777,00015,595,00016,793,600
4Jul 29, 2026 23:143,055468,364,248442,852,00015,503,00016,793,600
5Jul 29, 2026 23:143,056470,000,352443,558,00014,920,00016,793,600
6Jul 29, 2026 23:143,058468,919,705443,181,00015,597,00016,793,600
7Jul 29, 2026 23:143,064469,605,590444,311,00015,325,00016,793,600
8Jul 29, 2026 23:143,065469,804,410444,799,00015,045,00016,793,600
9Jul 29, 2026 23:143,067470,111,606444,452,00015,625,00016,793,600