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 27, 2026 23:38Victor MerckléVictor MerckléScore: 7,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 23:387,5791,158,945,2371,122,949,00013,986,00017,162,240
2Apr 27, 2026 23:387,5801,157,522,2431,125,116,00011,990,00017,158,144
3Apr 27, 2026 23:387,5801,157,375,6591,127,124,0009,992,00017,162,240
4Apr 27, 2026 23:387,5811,156,837,2701,127,149,00010,001,00017,006,592
5Apr 27, 2026 23:387,5811,156,527,7841,125,230,00011,991,00017,166,336
6Apr 27, 2026 23:387,5831,156,157,2911,127,538,0009,995,00017,154,048
7Apr 27, 2026 23:387,5841,155,852,5311,124,726,00012,996,00017,158,144
8Apr 27, 2026 23:387,5961,156,670,4131,127,498,00011,994,00017,162,240
9Apr 27, 2026 23:387,5971,157,572,1351,127,677,00011,996,00017,162,240