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 15:43Navneet RajNavneet RajScore: 59,243Success
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 15:5559,0288,864,598,3278,828,769,00025,532,00016,793,600
2Aug 23, 2026 15:5559,0408,866,364,1608,831,182,00024,854,00016,793,600
3Aug 23, 2026 15:5559,0838,872,571,7018,837,750,00024,834,00016,793,600
4Aug 23, 2026 15:5559,1968,889,397,3848,855,090,00024,321,00016,793,600
5Aug 23, 2026 15:5559,2438,896,381,6888,862,410,00024,075,00016,793,600
6Aug 23, 2026 15:5559,2678,901,310,9678,864,115,00025,959,00016,793,600
7Aug 23, 2026 15:5559,2708,900,511,3158,865,934,00024,609,00016,793,600
8Aug 23, 2026 15:5559,2928,904,835,9938,869,251,00024,621,00016,793,600
9Aug 23, 2026 15:5559,3098,906,434,3798,872,078,00024,322,00016,793,600