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 listApr 12, 2026 13:49limanjun99limanjun99Score: 49,124Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 13:4949,082147,467,301119,688,0003,017,000892,928
2Apr 12, 2026 13:4949,124145,638,383119,815,0002,995,000733,184
3Apr 12, 2026 13:4949,184147,941,990120,961,0001,999,000786,432