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 18:35Victor MerckléVictor MerckléScore: 2,712Success
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 18:362,62414,396,5795,244,0001,316,0002,113,536
2May 29, 2026 18:362,63614,394,7575,280,0001,312,0002,113,536
3May 29, 2026 18:362,66116,600,9475,309,0001,345,0002,113,536
4May 29, 2026 18:362,66814,954,9795,325,0001,346,0002,113,536
5May 29, 2026 18:362,71217,559,5085,477,0001,303,0002,113,536
6May 29, 2026 18:362,73414,604,6705,532,0001,304,0002,113,536
7May 29, 2026 18:362,74114,657,6735,547,0001,306,0002,113,536
8May 29, 2026 18:362,74716,022,2355,564,0001,304,0002,113,536
9May 29, 2026 18:362,79414,853,7035,650,0001,335,0002,113,536