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 4, 2026 19:07olliecrowolliecrowScore: 18,354Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 19:0718,32671,975,87040,836,0004,980,0002,445,312
2Mar 4, 2026 19:0718,35470,747,78938,902,0006,982,0002,396,160
3Mar 4, 2026 19:0718,49571,887,36340,207,0006,031,0002,396,160