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 listDec 29, 2025 17:48KeefeKeefeScore: 22,056Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 17:4822,02579,936,55753,061,0002,002,0002,297,856
2Dec 29, 2025 17:4822,05676,951,92351,130,0004,010,0002,314,240
3Dec 29, 2025 17:4822,06284,403,39452,146,0003,008,0002,314,240