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 18:09olliecrowolliecrowScore: 34,962Success
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 18:0934,900113,397,85882,237,0005,014,0002,281,472
2Mar 4, 2026 18:0934,962111,024,66484,392,0003,014,0002,416,640
3Mar 4, 2026 18:0935,138115,321,51281,855,0005,989,0002,400,256