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:57TudyMTudyMScore: 5,526Success
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:585,499841,193,169795,993,00028,999,00017,141,760
2Apr 28, 2026 08:585,515845,062,123797,363,00029,976,00017,022,976
3Apr 28, 2026 08:585,525850,582,233800,879,00027,995,00017,059,840
4Apr 28, 2026 08:585,525850,367,555802,827,00025,994,00017,137,664
5Apr 28, 2026 08:585,526850,865,269797,944,00030,997,00017,227,776
6Apr 28, 2026 08:585,530847,418,059800,574,00028,984,00017,149,952
7Apr 28, 2026 08:585,536850,140,048798,533,00031,981,00017,137,664
8Apr 28, 2026 08:585,539850,452,537799,917,00030,996,00017,145,856
9Apr 28, 2026 08:585,548850,539,767797,258,00034,967,00017,145,856