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 28, 2026 03:33Elijah KinElijah KinScore: 5,698Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 28, 2026 03:355,52823,157,92211,610,0002,210,0002,113,536
2May 28, 2026 03:355,52923,744,35411,614,0002,210,0002,113,536
3May 28, 2026 03:355,55424,926,92711,685,0002,202,0002,113,536
4May 28, 2026 03:355,61825,219,02210,914,0003,132,0002,113,536
5May 28, 2026 03:355,69823,607,02910,999,0003,248,0002,113,536
6May 28, 2026 03:355,71925,262,88111,184,0003,115,0002,113,536
7May 28, 2026 03:355,77123,830,15511,160,0003,269,0002,117,632
8May 28, 2026 03:355,99224,457,60411,759,0003,223,0002,113,536
9May 28, 2026 03:356,04624,304,56611,916,0003,200,0002,113,536