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 17:48anboto1anboto1Score: 3,017Success
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 17:483,010461,655,518442,964,0008,680,00016,793,600
2Jul 29, 2026 17:483,012461,866,961443,180,0008,711,00016,793,600
3Jul 29, 2026 17:483,014462,285,556443,610,0008,631,00016,793,600
4Jul 29, 2026 17:483,016462,382,491443,809,0008,620,00016,793,600
5Jul 29, 2026 17:483,017463,282,166444,000,0008,685,00016,793,600
6Jul 29, 2026 17:483,018462,825,235444,079,0008,683,00016,793,600
7Jul 29, 2026 17:483,019463,018,920444,267,0008,718,00016,793,600
8Jul 29, 2026 17:483,019469,885,145444,197,0008,755,00016,793,600
9Jul 29, 2026 17:483,020463,046,388444,390,0008,732,00016,793,600