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:51TudyMTudyMScore: 5,665Success
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:515,516847,454,914798,442,00028,979,00017,166,336
2Apr 28, 2026 08:515,557852,078,349798,692,00034,986,00017,174,528
3Apr 28, 2026 08:515,592853,815,117807,831,00030,993,00017,231,872
4Apr 28, 2026 08:515,601858,100,441804,269,00035,967,00017,170,432
5Apr 28, 2026 08:515,665871,205,647819,838,00029,994,00017,125,376
6Apr 28, 2026 08:515,665867,819,874816,816,00032,992,00017,162,240
7Apr 28, 2026 08:515,676873,415,716819,560,00031,982,00017,125,376
8Apr 28, 2026 08:515,773889,463,241836,043,00030,001,00017,174,528
9Apr 28, 2026 08:515,814889,274,509838,249,00033,969,00017,166,336