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 listAug 9, 2026 20:56TonyTonyScore: 12,912Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2026 20:5712,8301,935,105,2741,886,227,00038,284,00016,793,600
2Aug 9, 2026 20:5712,8481,937,198,6761,887,891,00039,349,00016,793,600
3Aug 9, 2026 20:5712,8621,939,332,7041,890,627,00038,692,00016,793,600
4Aug 9, 2026 20:5712,8761,941,369,1331,893,124,00038,371,00016,793,600
5Aug 9, 2026 20:5712,9121,947,079,1361,898,594,00038,283,00016,793,600
6Aug 9, 2026 20:5712,9371,950,755,2811,902,235,00038,357,00016,793,600
7Aug 9, 2026 20:5712,9421,951,241,2431,902,959,00038,416,00016,793,600
8Aug 9, 2026 20:5713,3852,018,750,2941,969,674,00038,114,00016,793,600
9Aug 9, 2026 20:5713,9742,106,065,1662,057,540,00038,590,00016,793,600