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:19Elijah KinElijah KinScore: 2,474Success
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:202,23814,594,1424,483,0001,114,0002,117,632
2Jun 7, 2026 16:202,24214,618,4164,491,0001,114,0002,117,632
3Jun 7, 2026 16:202,36314,949,4284,795,0001,114,0002,117,632
4Jun 7, 2026 16:202,46415,126,9575,051,0001,109,0002,117,632
5Jun 7, 2026 16:202,47418,376,4345,074,0001,112,0002,117,632
6Jun 7, 2026 16:202,49015,802,1595,116,0001,109,0002,117,632
7Jun 7, 2026 16:202,49115,964,0655,116,0001,112,0002,117,632
8Jun 7, 2026 16:202,50215,740,1325,144,0001,113,0002,117,632
9Jun 7, 2026 16:202,51615,711,0775,181,0001,109,0002,117,632