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 22:53Jacob McDanielJacob McDanielScore: 12,038Success
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 22:5511,88940,836,34223,527,0006,197,0002,113,536
2May 16, 2026 22:5511,89538,573,51223,442,0006,297,0002,113,536
3May 16, 2026 22:5511,97338,892,65823,604,0006,330,0002,113,536
4May 16, 2026 22:5512,00440,802,20223,614,0006,398,0002,113,536
5May 16, 2026 22:5512,03839,012,74723,399,0006,696,0002,113,536
6May 16, 2026 22:5512,03941,744,75923,342,0006,757,0002,113,536
7May 16, 2026 22:5512,10439,096,91123,891,0006,369,0002,113,536
8May 16, 2026 22:5512,15742,181,21423,417,0006,976,0002,113,536
9May 16, 2026 22:5512,36239,751,09124,541,0006,364,0002,113,536