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 listNov 3, 2026 23:22Andrew EpsteinAndrew EpsteinScore: 19,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 23:2319,0362,865,421,3152,805,342,00050,167,00016,805,888stderr
2Nov 3, 2026 23:2319,0372,865,109,3252,805,337,00050,309,00016,805,888stderr
3Nov 3, 2026 23:2319,0382,865,307,4312,805,368,00050,407,00016,805,888stderr
4Nov 3, 2026 23:2319,0392,865,753,9852,805,164,00050,717,00016,801,792stderr
5Nov 3, 2026 23:2319,0402,866,401,0522,804,980,00051,155,00016,801,792stderr
6Nov 3, 2026 23:2319,0422,866,516,1832,805,018,00051,379,00016,801,792stderr
7Nov 3, 2026 23:2319,0782,871,698,5012,811,033,00050,783,00016,805,888stderr
8Nov 3, 2026 23:2319,0792,871,245,2622,811,024,00050,838,00016,801,792stderr
9Nov 3, 2026 23:2319,0822,871,755,1902,811,425,00050,893,00016,805,888stderr