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 11:47Victor MerckléVictor MerckléScore: 2,537Success
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 11:492,52114,105,2304,970,0001,333,0002,113,536
2May 30, 2026 11:492,52714,029,1774,984,0001,335,0002,113,536
3May 30, 2026 11:492,52814,098,5834,988,0001,334,0002,113,536
4May 30, 2026 11:492,53114,988,5324,997,0001,331,0002,113,536
5May 30, 2026 11:492,53714,866,4745,007,0001,336,0002,113,536
6May 30, 2026 11:492,54214,222,8715,016,0001,340,0002,113,536
7May 30, 2026 11:492,55314,089,5035,034,0001,350,0002,113,536
8May 30, 2026 11:492,58714,194,8435,101,0001,367,0002,113,536
9May 30, 2026 11:492,59714,277,8665,122,0001,372,0002,113,536