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 listMay 16, 2026 11:01Jacob McDanielJacob McDanielScore: 1,573,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 11:011,572,2843,939,436,0163,929,707,0001,005,0002,113,536
2May 16, 2026 11:011,573,3503,941,874,8563,932,101,0001,275,0002,113,536
3May 16, 2026 11:011,573,7853,944,740,3233,933,195,0001,269,0002,113,536