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:40TudyMTudyMScore: 5,700Success
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:415,607863,267,348812,110,00029,003,00017,145,856
2Apr 28, 2026 08:415,622860,226,675809,424,00033,975,00017,149,952
3Apr 28, 2026 08:415,624861,850,387811,738,00031,989,00017,055,744
4Apr 28, 2026 08:415,671868,376,959820,801,00029,992,00017,158,144
5Apr 28, 2026 08:415,700872,233,037821,015,00034,000,00017,137,664
6Apr 28, 2026 08:415,785885,634,145840,835,00026,994,00017,129,472
7Apr 28, 2026 08:415,799886,702,144836,890,00032,995,00017,092,608
8Apr 28, 2026 08:415,851896,467,583840,734,00036,988,00017,137,664
9Apr 28, 2026 08:415,913904,525,710852,008,00035,000,00017,117,184