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:17Elijah KinElijah KinScore: 2,262Success
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:222,23714,622,6704,481,0001,113,0002,117,632
2Jun 7, 2026 00:222,24817,242,9884,508,0001,113,0002,117,632
3Jun 7, 2026 00:222,24914,622,6914,507,0001,117,0002,117,632
4Jun 7, 2026 00:222,25414,709,5634,374,0001,261,0002,117,632
5Jun 7, 2026 00:222,26214,660,4424,539,0001,117,0002,117,632
6Jun 7, 2026 00:222,44415,144,8345,004,0001,108,0002,117,632
7Jun 7, 2026 00:222,48415,693,5835,098,0001,114,0002,117,632
8Jun 7, 2026 00:222,49415,224,8755,138,0001,099,0002,117,632
9Jun 7, 2026 00:222,50215,214,1385,152,0001,105,0002,117,632