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 00:38Elijah KinElijah KinScore: 2,438Success
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 00:402,24514,639,7334,490,0001,123,0002,117,632
2Jun 7, 2026 00:402,25616,773,6714,523,0001,118,0002,117,632
3Jun 7, 2026 00:402,36514,941,1354,791,0001,122,0002,117,632
4Jun 7, 2026 00:402,39114,974,4594,874,0001,105,0002,117,632
5Jun 7, 2026 00:402,43815,132,9624,993,0001,104,0002,117,632
6Jun 7, 2026 00:402,45015,129,3705,020,0001,106,0002,117,632
7Jun 7, 2026 00:402,45715,168,4765,035,0001,108,0002,117,632
8Jun 7, 2026 00:402,47015,633,2105,063,0001,114,0002,117,632
9Jun 7, 2026 00:402,52815,780,5115,207,0001,114,0002,117,632