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 listSep 19, 2026 13:28Andrew EpsteinAndrew EpsteinScore: 4,858Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 13:404,84422,135,3466,886,0005,226,000540,672stderr
2Sep 19, 2026 13:404,85022,147,5056,893,0005,234,000536,576stderr
3Sep 19, 2026 13:404,85122,222,2466,892,0005,237,000540,672stderr
4Sep 19, 2026 13:404,85822,367,7446,900,0005,246,000540,672stderr
5Sep 19, 2026 13:404,85822,254,9716,907,0005,238,000536,576stderr
6Sep 19, 2026 13:404,86622,258,2946,920,0005,245,000536,576stderr
7Sep 19, 2026 13:404,87322,353,5186,905,0005,278,000540,672stderr
8Sep 19, 2026 13:404,88122,342,2536,914,0005,289,000540,672stderr
9Sep 19, 2026 13:404,88222,233,7666,946,0005,261,000536,576stderr