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 listAug 27, 2026 16:47Elijah KinElijah KinScore: 2,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 16:472,00914,906,8873,784,0001,239,0002,117,632
2Aug 27, 2026 16:472,02014,924,6893,803,0001,249,0002,117,632
3Aug 27, 2026 16:472,19615,420,6434,234,0001,258,0002,117,632
4Aug 27, 2026 16:472,22915,431,3314,324,0001,250,0002,117,632
5Aug 27, 2026 16:472,23015,372,3734,303,0001,273,0002,117,632
6Aug 27, 2026 16:472,24715,408,5994,372,0001,246,0002,117,632
7Aug 27, 2026 16:472,25815,495,5034,400,0001,246,0002,117,632
8Aug 27, 2026 16:472,28115,422,6204,449,0001,255,0002,117,632
9Aug 27, 2026 16:472,31115,473,7824,536,0001,243,0002,117,632