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:09TudyMTudyMScore: 5,524Success
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:105,471843,435,811794,674,00025,989,00017,002,496
2Apr 28, 2026 09:105,487840,436,366797,215,00025,974,00017,145,856
3Apr 28, 2026 09:105,504845,500,733794,641,00030,986,00017,149,952
4Apr 28, 2026 09:105,518848,233,543793,785,00033,990,00017,158,144
5Apr 28, 2026 09:105,524848,261,981799,731,00028,990,00017,137,664
6Apr 28, 2026 09:105,533846,559,808798,051,00032,002,00016,973,824
7Apr 28, 2026 09:105,537851,875,751802,683,00027,988,00017,141,760
8Apr 28, 2026 09:105,579857,767,320802,019,00034,957,00017,141,760
9Apr 28, 2026 09:105,599856,903,394814,887,00024,996,00017,149,952