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 listSep 21, 2026 13:27Andrew EpsteinAndrew EpsteinScore: 2,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 13:272,331360,061,967328,227,00021,474,00016,793,600
2Sep 21, 2026 13:272,337360,814,791329,121,00021,503,00016,793,600
3Sep 21, 2026 13:272,356363,904,662331,935,00021,602,00016,793,600
4Sep 21, 2026 13:272,358364,314,876332,205,00021,588,00016,793,600
5Sep 21, 2026 13:272,364364,913,910333,064,00021,554,00016,793,600
6Sep 21, 2026 13:272,365365,137,309331,128,00023,668,00016,793,600
7Sep 21, 2026 13:272,372366,236,813332,101,00023,778,00016,793,600
8Sep 21, 2026 13:272,393369,309,211337,559,00021,527,00016,793,600
9Sep 21, 2026 13:272,450377,826,720345,000,00022,500,00016,793,600