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:40limanjun99limanjun99Score: 3,429Success
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:403,42926,620,5466,429,0002,143,0002,326,528
2Apr 13, 2026 08:403,42929,943,4005,358,0003,215,0002,506,752
3Apr 13, 2026 08:403,46129,996,2437,571,0001,081,0002,510,848