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 26, 2026 17:19Elijah KinElijah KinScore: 9,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2026 17:199,74334,524,13219,080,0005,279,0002,113,536
2May 26, 2026 17:199,77835,507,01319,073,0005,374,0002,113,536
3May 26, 2026 17:199,78335,683,07519,201,0005,258,0002,113,536
4May 26, 2026 17:199,80434,157,35519,118,0005,392,0002,113,536
5May 26, 2026 17:199,85437,008,15119,199,0005,436,0002,113,536
6May 26, 2026 17:199,87034,400,14219,936,0004,741,0002,113,536
7May 26, 2026 17:199,94935,057,89719,303,0005,571,0002,113,536
8May 26, 2026 17:1910,07135,085,57819,743,0005,436,0002,113,536
9May 26, 2026 17:1910,18036,577,79220,130,0005,322,0002,113,536