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 14, 2026 10:41Victor MerckléVictor MerckléScore: 1,562Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 10:421,47012,232,2492,578,0001,097,0002,117,632stderr
2Sep 14, 2026 10:421,47812,282,3262,593,0001,103,0002,117,632stderr
3Sep 14, 2026 10:421,53412,528,8192,716,0001,119,0002,117,632stderr
4Sep 14, 2026 10:421,53612,345,4272,706,0001,134,0002,117,632stderr
5Sep 14, 2026 10:421,56212,548,9362,763,0001,143,0002,117,632stderr
6Sep 14, 2026 10:421,56813,303,4582,785,0001,137,0002,117,632stderr
7Sep 14, 2026 10:421,58012,501,9682,795,0001,157,0002,117,632stderr
8Sep 14, 2026 10:421,59312,453,9492,825,0001,159,0002,117,632stderr
9Sep 14, 2026 10:421,59422,172,4212,838,0001,148,0002,117,632stderr