Large integer multiplication Bernard Teo

Multiply two large unsigned integers as fast as possible.

Input

Exactly 500,000 bytes on STDIN: two unsigned integers encoded back-to-back, each 250,000 bytes, in little-endian byte order.

Output

Write exactly 500,000 bytes to STDOUT containing the product in little-endian byte order.

Back to listMay 20, 2026 10:47Jacob McDanielJacob McDanielScore: 2,931Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 10:482,88518,857,1566,050,0001,163,0002,117,632
2May 20, 2026 10:482,89417,476,1536,064,0001,172,0002,113,536
3May 20, 2026 10:482,89617,503,0036,066,0001,176,0002,117,632
4May 20, 2026 10:482,90217,473,3356,075,0001,182,0002,117,632
5May 20, 2026 10:482,93117,697,7486,086,0001,242,0002,117,632
6May 20, 2026 10:482,94218,771,9446,096,0001,261,0002,117,632
7May 20, 2026 10:482,94819,204,9566,109,0001,263,0002,117,632
8May 20, 2026 10:482,98518,963,4266,214,0001,250,0002,117,632
9May 20, 2026 10:483,01219,010,5796,282,0001,248,0002,117,632