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 20:51Elijah KinElijah KinScore: 2,236Success
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 20:522,06415,045,5353,924,0001,236,0002,117,632
2Aug 27, 2026 20:522,06514,913,1313,930,0001,233,0002,117,632
3Aug 27, 2026 20:522,07015,054,1703,932,0001,244,0002,117,632
4Aug 27, 2026 20:522,22415,327,0924,301,0001,261,0002,117,632
5Aug 27, 2026 20:522,23615,335,9824,322,0001,268,0002,117,632
6Aug 27, 2026 20:522,32815,534,5544,585,0001,235,0002,117,632
7Aug 27, 2026 20:522,33315,637,1614,594,0001,240,0002,117,632
8Aug 27, 2026 20:522,36015,641,8584,639,0001,261,0002,117,632
9Aug 27, 2026 20:522,36616,398,8484,679,0001,238,0002,117,632