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 27, 2026 18:52Elijah KinElijah KinScore: 6,405Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 27, 2026 18:536,15027,495,47012,026,0003,349,0002,113,536
2May 27, 2026 18:536,15224,467,69312,103,0003,277,0002,113,536
3May 27, 2026 18:536,24824,705,53312,305,0003,317,0002,113,536
4May 27, 2026 18:536,28926,544,44612,400,0003,324,0002,113,536
5May 27, 2026 18:536,40526,812,02012,700,0003,314,0002,113,536
6May 27, 2026 18:536,43226,103,99712,779,0003,303,0002,113,536
7May 27, 2026 18:536,47227,404,31912,825,0003,356,0002,113,536
8May 27, 2026 18:536,59525,676,54012,963,0003,525,0002,113,536
9May 27, 2026 18:536,74126,864,58113,431,0003,423,0002,113,536