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 17:51Elijah KinElijah KinScore: 2,504Success
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 17:522,26315,427,5714,398,0001,261,0002,117,632
2Aug 27, 2026 17:522,27115,442,4214,427,0001,251,0002,117,632
3Aug 27, 2026 17:522,44115,848,9084,840,0001,263,0002,117,632
4Aug 27, 2026 17:522,49316,000,7004,969,0001,265,0002,117,632
5Aug 27, 2026 17:522,50416,015,0004,993,0001,268,0002,117,632
6Aug 27, 2026 17:522,51816,115,8985,207,0001,088,0002,117,632
7Aug 27, 2026 17:522,52716,871,5785,048,0001,271,0002,117,632
8Aug 27, 2026 17:522,53416,162,5185,085,0001,252,0002,117,632
9Aug 27, 2026 17:522,61116,593,1585,196,0001,332,0002,117,632