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 listMar 15, 2026 01:01Elijah KinElijah KinScore: 62,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 01:0162,455184,142,780155,138,0001,000,0002,314,240
2Mar 15, 2026 01:0162,489182,804,331153,218,0003,004,0002,265,088
3Mar 15, 2026 01:0162,734182,515,771153,840,0002,996,0002,265,088