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:58TonyTonyScore: 4,106Success
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:594,097625,133,266604,074,00010,509,00016,793,600
2Aug 9, 2026 20:594,097624,437,813604,277,00010,280,00016,793,600
3Aug 9, 2026 20:594,101625,119,802604,516,00010,731,00016,793,600
4Aug 9, 2026 20:594,103625,322,465605,048,00010,440,00016,793,600
5Aug 9, 2026 20:594,106625,783,685605,152,00010,767,00016,793,600
6Aug 9, 2026 20:594,109626,328,983605,810,00010,658,00016,793,600
7Aug 9, 2026 20:594,111626,527,516606,470,00010,323,00016,793,600
8Aug 9, 2026 20:594,115627,297,076606,698,00010,658,00016,793,600
9Aug 9, 2026 20:594,117627,506,842606,869,00010,768,00016,793,600