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 03:16Elijah KinElijah KinScore: 2,396Success
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 03:172,13814,420,9174,074,0001,271,0002,117,632
2Jun 8, 2026 03:172,13814,485,4384,065,0001,280,0002,117,632
3Jun 8, 2026 03:172,30414,855,6264,458,0001,303,0002,117,632
4Jun 8, 2026 03:172,38815,014,0944,675,0001,296,0002,117,632
5Jun 8, 2026 03:172,39615,089,9024,680,0001,311,0002,117,632
6Jun 8, 2026 03:172,39915,000,0134,707,0001,291,0002,117,632
7Jun 8, 2026 03:172,40215,017,9534,731,0001,275,0002,117,632
8Jun 8, 2026 03:172,40915,070,9514,738,0001,286,0002,117,632
9Jun 8, 2026 03:172,49315,708,4475,135,0001,098,0002,117,632