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 7, 2026 16:41Elijah KinElijah KinScore: 2,496Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 16:422,41615,089,9014,930,0001,111,0002,117,632
2Jun 7, 2026 16:422,44115,126,7574,989,0001,115,0002,117,632
3Jun 7, 2026 16:422,45015,149,6415,012,0001,115,0002,117,632
4Jun 7, 2026 16:422,49115,241,7625,119,0001,109,0002,117,632
5Jun 7, 2026 16:422,49615,360,5125,128,0001,112,0002,117,632
6Jun 7, 2026 16:422,50515,496,0945,152,0001,112,0002,117,632
7Jun 7, 2026 16:422,52215,334,7735,198,0001,108,0002,117,632
8Jun 7, 2026 16:422,52215,365,1185,199,0001,107,0002,117,632
9Jun 7, 2026 16:422,60515,610,4055,255,0001,259,0002,117,632