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 29, 2026 23:25Victor MerckléVictor MerckléScore: 2,580Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 23:262,52914,119,6274,993,0001,331,0002,113,536
2May 29, 2026 23:262,53415,907,3475,007,0001,330,0002,113,536
3May 29, 2026 23:262,53715,148,4665,010,0001,333,0002,113,536
4May 29, 2026 23:262,53914,089,2225,016,0001,332,0002,113,536
5May 29, 2026 23:262,58016,854,2535,091,0001,360,0002,113,536
6May 29, 2026 23:262,58716,028,5065,105,0001,363,0002,113,536
7May 29, 2026 23:262,59914,256,5925,133,0001,365,0002,113,536
8May 29, 2026 23:262,62115,636,0345,227,0001,327,0002,113,536
9May 29, 2026 23:262,63514,514,6555,257,0001,332,0002,113,536