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 3, 2026 16:15Elijah KinElijah KinScore: 3,676Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 16:163,48017,675,5037,599,0001,101,0002,117,632
2Jun 3, 2026 16:163,62819,905,9297,930,0001,140,0002,117,632
3Jun 3, 2026 16:163,62818,504,8127,931,0001,140,0002,117,632
4Jun 3, 2026 16:163,67518,638,5848,041,0001,148,0002,117,632
5Jun 3, 2026 16:163,67620,315,5818,024,0001,167,0002,117,632
6Jun 3, 2026 16:163,68318,635,4418,066,0001,143,0002,117,632
7Jun 3, 2026 16:163,69818,684,3468,098,0001,149,0002,117,632
8Jun 3, 2026 16:163,70820,435,7178,107,0001,164,0002,117,632
9Jun 3, 2026 16:163,71918,672,8718,124,0001,174,0002,117,632