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 13, 2026 08:22limanjun99limanjun99Score: 3,474Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 08:223,40325,677,1484,254,0004,254,0002,519,040
2Apr 13, 2026 08:223,47426,738,5647,600,0001,085,0002,461,696
3Apr 13, 2026 08:223,47425,390,0607,601,0001,085,0002,289,664