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 19, 2026 21:20Jacob McDanielJacob McDanielScore: 2,794Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 21:212,77116,280,7095,724,0001,205,0002,117,632
2May 19, 2026 21:212,77818,131,3085,742,0001,205,0002,117,632
3May 19, 2026 21:212,78216,162,8945,738,0001,219,0002,117,632
4May 19, 2026 21:212,78317,344,0335,730,0001,229,0002,117,632
5May 19, 2026 21:212,79418,320,9655,774,0001,213,0002,113,536
6May 19, 2026 21:212,81318,207,1965,768,0001,265,0002,117,632
7May 19, 2026 21:212,81418,624,3315,797,0001,239,0002,117,632
8May 19, 2026 21:212,82917,434,1015,787,0001,286,0002,117,632
9May 19, 2026 21:212,86516,959,5095,866,0001,297,0002,117,632