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 15:33Elijah KinElijah KinScore: 2,479Success
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 15:342,24514,733,8144,395,0001,218,0002,117,632
2Jun 8, 2026 15:342,26214,808,5824,427,0001,229,0002,117,632
3Jun 8, 2026 15:342,37416,701,3674,697,0001,240,0002,117,632
4Jun 8, 2026 15:342,42015,124,8894,817,0001,234,0002,117,632
5Jun 8, 2026 15:342,47915,264,0485,086,0001,112,0002,117,632
6Jun 8, 2026 15:342,49515,327,1614,992,0001,247,0002,117,632
7Jun 8, 2026 15:342,50215,347,5825,027,0001,228,0002,117,632
8Jun 8, 2026 15:342,50915,387,9635,021,0001,253,0002,117,632
9Jun 8, 2026 15:342,51015,312,4975,043,0001,232,0002,117,632