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 8, 2026 21:32Elijah KinElijah KinScore: 2,448Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 21:372,18614,457,8224,217,0001,248,0002,117,632
2Jun 8, 2026 21:372,18614,804,5784,196,0001,271,0002,117,632
3Jun 8, 2026 21:372,19414,594,4764,215,0001,271,0002,117,632
4Jun 8, 2026 21:372,19614,618,1794,231,0001,260,0002,117,632
5Jun 8, 2026 21:372,44815,181,8214,830,0001,292,0002,117,632
6Jun 8, 2026 21:372,50415,314,5314,987,0001,275,0002,117,632
7Jun 8, 2026 21:372,50815,378,7734,992,0001,279,0002,117,632
8Jun 8, 2026 21:372,51315,388,7414,986,0001,297,0002,117,632
9Jun 8, 2026 21:372,56515,962,8365,103,0001,311,0002,117,632