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 5, 2026 19:26Elijah KinElijah KinScore: 2,592Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 19:282,52615,351,3235,221,0001,096,0002,117,632
2Jun 5, 2026 19:282,53315,372,1005,220,0001,114,0002,117,632
3Jun 5, 2026 19:282,54015,359,5305,258,0001,094,0002,117,632
4Jun 5, 2026 19:282,57415,442,8405,313,0001,123,0002,117,632
5Jun 5, 2026 19:282,59215,536,1845,361,0001,120,0002,117,632
6Jun 5, 2026 19:282,62315,979,5825,428,0001,131,0002,117,632
7Jun 5, 2026 19:282,62415,783,6515,434,0001,126,0002,117,632
8Jun 5, 2026 19:282,67415,750,8855,529,0001,156,0002,117,632
9Jun 5, 2026 19:282,67915,936,4165,578,0001,120,0002,117,632