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:39limanjun99limanjun99Score: 3,427Success
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:393,41824,675,1796,409,0002,136,0002,285,568
2Apr 13, 2026 08:393,42723,939,2336,426,0002,142,0002,289,664
3Apr 13, 2026 08:393,43431,005,3745,365,0003,219,0002,506,752