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 listSep 19, 2026 18:46Elijah KinElijah KinScore: 2,294Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 18:472,14515,519,4874,102,0001,262,0002,117,632
2Sep 19, 2026 18:472,24915,782,6134,353,0001,270,0002,117,632
3Sep 19, 2026 18:472,27815,808,9314,423,0001,274,0002,117,632
4Sep 19, 2026 18:472,27815,850,8184,431,0001,266,0002,117,632
5Sep 19, 2026 18:472,29415,870,7624,476,0001,261,0002,117,632
6Sep 19, 2026 18:472,31215,924,0304,524,0001,258,0002,117,632
7Sep 19, 2026 18:472,33416,090,9734,580,0001,257,0002,117,632
8Sep 19, 2026 18:472,35015,980,5884,601,0001,274,0002,117,632
9Sep 19, 2026 18:472,39216,842,2624,864,0001,117,0002,117,632