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 05:05Elijah KinElijah KinScore: 2,290Success
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 05:062,00814,137,7913,833,0001,189,0002,117,632
2Jun 9, 2026 05:062,01914,287,8123,841,0001,208,0002,117,632
3Jun 9, 2026 05:062,17914,515,9794,248,0001,201,0002,117,632
4Jun 9, 2026 05:062,21414,666,0214,332,0001,204,0002,117,632
5Jun 9, 2026 05:062,29014,794,6734,526,0001,201,0002,117,632
6Jun 9, 2026 05:062,32414,914,4784,615,0001,195,0002,117,632
7Jun 9, 2026 05:062,32414,910,5614,599,0001,211,0002,117,632
8Jun 9, 2026 05:062,35115,376,1704,663,0001,216,0002,117,632
9Jun 9, 2026 05:062,35214,946,2004,684,0001,196,0002,117,632