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 09:11TudyMTudyMScore: 5,516Success
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 09:125,492844,945,924793,845,00029,994,00017,092,608
2Apr 28, 2026 09:125,494842,101,497798,257,00025,975,00017,158,144
3Apr 28, 2026 09:125,495839,067,997794,293,00029,973,00017,149,952
4Apr 28, 2026 09:125,501840,943,713797,269,00027,974,00017,141,760
5Apr 28, 2026 09:125,516845,654,292795,512,00031,980,00017,092,608
6Apr 28, 2026 09:125,517847,525,992795,707,00031,988,00017,129,472
7Apr 28, 2026 09:125,525845,375,601800,798,00027,992,00017,149,952
8Apr 28, 2026 09:125,525847,115,697797,766,00030,990,00017,002,496
9Apr 28, 2026 09:125,534848,364,731799,192,00030,968,00017,137,664