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 4, 2026 20:20Elijah KinElijah KinScore: 2,711Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2026 20:212,52215,421,2275,183,0001,122,0002,117,632
2Jun 4, 2026 20:212,54316,973,5845,219,0001,139,0002,117,632
3Jun 4, 2026 20:212,55615,453,6815,263,0001,128,0002,117,632
4Jun 4, 2026 20:212,55715,414,6605,255,0001,138,0002,117,632
5Jun 4, 2026 20:212,71118,073,3125,634,0001,144,0002,117,632
6Jun 4, 2026 20:212,71517,647,2115,606,0001,183,0002,117,632
7Jun 4, 2026 20:212,72315,811,3335,655,0001,153,0002,117,632
8Jun 4, 2026 20:212,75816,300,1135,717,0001,178,0002,117,632
9Jun 4, 2026 20:212,79416,460,6395,805,0001,180,0002,117,632