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 23, 2026 17:11Navneet RajNavneet RajScore: 14,800Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 17:1214,2892,154,580,0372,129,922,00013,478,00016,793,600
2Aug 23, 2026 17:1214,4312,174,716,8582,151,214,00013,512,00016,793,600
3Aug 23, 2026 17:1214,4542,187,622,1472,154,775,00013,341,00016,793,600
4Aug 23, 2026 17:1214,6892,213,361,0382,189,668,00013,757,00016,793,600
5Aug 23, 2026 17:1214,8002,230,252,1192,206,359,00013,735,00016,793,600
6Aug 23, 2026 17:1214,9962,259,501,0612,235,939,00013,560,00016,793,600
7Aug 23, 2026 17:1215,0562,268,421,4292,244,964,00013,468,00016,793,600
8Aug 23, 2026 17:1215,4582,328,781,8432,304,900,00013,813,00016,793,600
9Aug 23, 2026 17:1215,7332,369,983,7672,346,698,00013,390,00016,793,600