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 21:10Victor MerckléVictor MerckléScore: 2,549Success
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 21:122,53316,020,2315,009,0001,325,0002,113,536
2May 29, 2026 21:122,54114,094,7065,023,0001,330,0002,113,536
3May 29, 2026 21:122,54515,648,8085,038,0001,325,0002,113,536
4May 29, 2026 21:122,54716,277,6275,040,0001,328,0002,113,536
5May 29, 2026 21:122,54914,245,1315,047,0001,327,0002,113,536
6May 29, 2026 21:122,58517,409,2705,113,0001,350,0002,113,536
7May 29, 2026 21:122,63014,750,7635,211,0001,365,0002,113,536
8May 29, 2026 21:122,63115,842,9295,253,0001,325,0002,113,536
9May 29, 2026 21:122,66416,114,8265,334,0001,327,0002,113,536