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 15:59Elijah KinElijah KinScore: 2,374Success
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 16:002,15214,486,8204,130,0001,252,0002,117,632
2Jun 7, 2026 16:002,16514,483,1374,145,0001,268,0002,117,632
3Jun 7, 2026 16:002,18416,011,0874,191,0001,271,0002,117,632
4Jun 7, 2026 16:002,19614,567,5964,200,0001,290,0002,117,632
5Jun 7, 2026 16:002,37415,412,2064,634,0001,301,0002,117,632
6Jun 7, 2026 16:002,42915,118,8304,789,0001,284,0002,117,632
7Jun 7, 2026 16:002,43015,160,5244,786,0001,291,0002,117,632
8Jun 7, 2026 16:002,44515,310,1724,831,0001,282,0002,117,632
9Jun 7, 2026 16:002,45415,142,6964,830,0001,305,0002,117,632