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 11:34Victor MerckléVictor MerckléScore: 2,760Success
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 11:352,62014,839,0465,209,0001,343,0002,113,536
2May 29, 2026 11:352,73215,021,9575,489,0001,341,0002,113,536
3May 29, 2026 11:352,73816,541,2135,506,0001,339,0002,113,536
4May 29, 2026 11:352,75414,625,1965,543,0001,342,0002,113,536
5May 29, 2026 11:352,76016,966,3185,533,0001,368,0002,113,536
6May 29, 2026 11:352,77314,734,3625,578,0001,355,0002,113,536
7May 29, 2026 11:352,78215,380,7195,608,0001,347,0002,113,536
8May 29, 2026 11:352,79014,698,5345,622,0001,354,0002,113,536
9May 29, 2026 11:352,81216,592,0784,734,0002,296,0002,113,536