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:33TudyMTudyMScore: 5,607Success
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:345,551855,342,010798,677,00033,986,00017,145,856
2Apr 28, 2026 08:345,574855,603,156805,167,00030,967,00017,141,760
3Apr 28, 2026 08:345,578854,453,462803,722,00032,988,00017,092,608
4Apr 28, 2026 08:345,594860,031,347810,174,00028,970,00017,215,488
5Apr 28, 2026 08:345,607860,837,536811,224,00029,971,00017,158,144
6Apr 28, 2026 08:345,650865,853,831816,602,00030,984,00017,154,048
7Apr 28, 2026 08:345,805889,920,760834,826,00035,992,00017,149,952
8Apr 28, 2026 08:345,852893,301,849843,826,00033,993,00017,014,784
9Apr 28, 2026 08:345,937909,965,838854,647,00035,985,00017,149,952