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 listMar 4, 2026 23:03olliecrowolliecrowScore: 3,515Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 23:033,510549,141,041514,471,00011,987,00017,031,168
2Mar 4, 2026 23:033,512555,335,441515,744,00010,994,00016,949,248
3Mar 4, 2026 23:033,513558,472,198515,881,00010,997,00017,063,936
4Mar 4, 2026 23:033,513550,489,223514,018,00013,000,00016,953,344
5Mar 4, 2026 23:033,515553,844,605516,228,00011,004,00017,014,784
6Mar 4, 2026 23:033,515551,114,839517,229,00010,004,00017,051,648
7Mar 4, 2026 23:033,515558,678,748517,278,0009,986,00017,051,648
8Mar 4, 2026 23:033,517555,761,041515,489,00011,988,00016,986,112
9Mar 4, 2026 23:033,520557,928,662515,974,00011,999,00017,076,224