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 05:20Victor MerckléVictor MerckléScore: 2,594Success
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 05:222,52014,065,3644,968,0001,333,0002,113,536
2May 30, 2026 05:222,53616,269,3105,005,0001,335,0002,113,536
3May 30, 2026 05:222,55614,797,9275,040,0001,351,0002,113,536
4May 30, 2026 05:222,58214,804,0275,126,0001,330,0002,113,536
5May 30, 2026 05:222,59414,862,9755,151,0001,336,0002,113,536
6May 30, 2026 05:222,61116,600,2075,200,0001,329,0002,113,536
7May 30, 2026 05:222,62014,471,1555,220,0001,330,0002,113,536
8May 30, 2026 05:222,67315,738,0094,411,0002,273,0002,113,536
9May 30, 2026 05:222,68814,603,0234,434,0002,286,0002,113,536