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 15, 2026 08:05Victor MerckléVictor MerckléScore: 1,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 08:061,35812,091,3081,834,0001,563,0002,117,632stderr
2Sep 15, 2026 08:061,37312,174,1291,879,0001,554,0002,117,632stderr
3Sep 15, 2026 08:061,42712,349,2162,021,0001,548,0002,117,632stderr
4Sep 15, 2026 08:061,44312,425,1912,080,0001,529,0002,117,632stderr
5Sep 15, 2026 08:061,47012,369,9742,115,0001,560,0002,117,632stderr
6Sep 15, 2026 08:061,47912,377,3402,127,0001,572,0002,117,632stderr
7Sep 15, 2026 08:061,48412,223,4422,122,0001,588,0002,117,632stderr
8Sep 15, 2026 08:061,48713,043,8212,125,0001,594,0002,117,632stderr
9Sep 15, 2026 08:061,50212,395,3852,144,0001,612,0002,117,632stderr