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 listApr 30, 2026 01:11Charles CabergsCharles CabergsScore: 3,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 01:113,819590,058,541565,981,0006,999,00017,072,128
2Apr 30, 2026 01:113,819593,073,840565,988,0006,999,00017,121,280
3Apr 30, 2026 01:113,821589,226,931567,240,0006,002,00017,121,280
4Apr 30, 2026 01:113,822587,565,976567,371,0006,003,00017,190,912
5Apr 30, 2026 01:113,822592,487,898563,438,0009,990,00017,018,880
6Apr 30, 2026 01:113,823589,944,917566,547,0006,994,00017,043,456
7Apr 30, 2026 01:113,823592,265,435565,564,0007,993,00017,121,280
8Apr 30, 2026 01:113,824596,324,380564,728,0008,995,00017,121,280
9Apr 30, 2026 01:113,826593,936,252567,984,0005,999,00016,990,208