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 08:12Jacob McDanielJacob McDanielScore: 2,753Success
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 08:122,71417,674,6615,579,0001,207,0002,121,728
2May 20, 2026 08:122,74216,179,0055,658,0001,198,0002,121,728
3May 20, 2026 08:122,74616,254,3945,659,0001,208,0002,121,728
4May 20, 2026 08:122,75019,277,4905,671,0001,204,0002,121,728
5May 20, 2026 08:122,75319,182,9875,669,0001,215,0002,121,728
6May 20, 2026 08:122,76318,318,7725,691,0001,218,0002,121,728
7May 20, 2026 08:122,76616,261,5565,700,0001,217,0002,121,728
8May 20, 2026 08:122,78416,257,8995,715,0001,246,0002,121,728
9May 20, 2026 08:122,93519,632,7256,075,0001,264,0002,121,728