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 20, 2026 14:36Victor MerckléVictor MerckléScore: 2,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 14:372,72214,561,2395,454,0001,352,0002,113,536
2May 20, 2026 14:372,72516,136,2655,458,0001,355,0002,113,536
3May 20, 2026 14:372,72814,674,7015,465,0001,356,0002,113,536
4May 20, 2026 14:372,73017,676,6825,472,0001,354,0002,113,536
5May 20, 2026 14:372,73115,266,0955,476,0001,353,0002,113,536
6May 20, 2026 14:372,78816,860,0075,583,0001,387,0002,113,536
7May 20, 2026 14:372,80416,633,7105,663,0001,348,0002,113,536
8May 20, 2026 14:372,86616,794,1365,804,0001,363,0002,113,536
9May 20, 2026 14:372,86616,009,9275,812,0001,353,0002,113,536