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 28, 2026 08:49TudyMTudyMScore: 5,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 08:505,405829,340,065775,819,00034,991,00017,227,776
2Apr 28, 2026 08:505,451835,262,823785,724,00031,988,00017,141,760
3Apr 28, 2026 08:505,548852,344,192798,263,00033,968,00017,149,952
4Apr 28, 2026 08:505,627862,314,346811,139,00033,005,00017,068,032
5Apr 28, 2026 08:505,651862,253,243816,747,00030,990,00017,145,856
6Apr 28, 2026 08:505,684871,587,717819,759,00032,990,00017,145,856
7Apr 28, 2026 08:505,820895,315,328841,033,00032,001,00016,990,208
8Apr 28, 2026 08:505,895903,709,327852,409,00031,977,00017,149,952
9Apr 28, 2026 08:506,007915,698,193866,225,00034,968,00017,199,104