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 listJun 9, 2026 21:04Elijah KinElijah KinScore: 2,315Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 21:052,21814,529,2934,338,0001,208,0002,117,632
2Jun 9, 2026 21:052,29214,755,7224,533,0001,199,0002,117,632
3Jun 9, 2026 21:052,29415,014,2984,533,0001,203,0002,117,632
4Jun 9, 2026 21:052,31415,093,2134,578,0001,208,0002,117,632
5Jun 9, 2026 21:052,31515,133,9414,581,0001,207,0002,117,632
6Jun 9, 2026 21:052,31615,098,9054,572,0001,219,0002,117,632
7Jun 9, 2026 21:052,32214,725,4944,575,0001,231,0002,117,632
8Jun 9, 2026 21:052,34114,865,4004,648,0001,205,0002,117,632
9Jun 9, 2026 21:052,36725,802,1664,708,0001,211,0002,113,536