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 22:42Elijah KinElijah KinScore: 2,889Success
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 22:452,83916,132,5855,989,0001,110,0002,117,632
2Jun 3, 2026 22:452,87916,440,7006,059,0001,139,0002,117,632
3Jun 3, 2026 22:452,88016,542,1936,058,0001,142,0002,117,632
4Jun 3, 2026 22:452,88816,300,3936,109,0001,112,0002,117,632
5Jun 3, 2026 22:452,88916,292,5956,070,0001,154,0002,117,632
6Jun 3, 2026 22:452,89916,258,8066,129,0001,119,0002,117,632
7Jun 3, 2026 22:452,90016,281,5206,072,0001,180,0002,117,632
8Jun 3, 2026 22:452,97116,865,9366,275,0001,153,0002,117,632
9Jun 3, 2026 22:453,02816,716,7436,406,0001,164,0002,117,632