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 30, 2026 13:01Victor MerckléVictor MerckléScore: 2,566Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 13:032,52914,107,9044,987,0001,336,0002,113,536
2May 30, 2026 13:032,53815,878,8465,005,0001,340,0002,113,536
3May 30, 2026 13:032,54914,785,5575,034,0001,339,0002,113,536
4May 30, 2026 13:032,54913,943,4655,036,0001,338,0002,113,536
5May 30, 2026 13:032,56617,263,0995,061,0001,355,0002,113,536
6May 30, 2026 13:032,59915,964,4285,125,0001,374,0002,113,536
7May 30, 2026 13:032,64815,448,1975,282,0001,339,0002,113,536
8May 30, 2026 13:032,66216,424,5065,318,0001,337,0002,113,536
9May 30, 2026 13:032,67014,946,0395,322,0001,354,0002,113,536