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 listAug 29, 2026 09:17Victor MerckléVictor MerckléScore: 1,598Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 09:191,55212,377,4942,806,0001,075,0002,117,632stderr
2Aug 29, 2026 09:191,55712,282,2552,805,0001,089,0002,117,632stderr
3Aug 29, 2026 09:191,59014,173,5512,862,0001,114,0002,117,632stderr
4Aug 29, 2026 09:191,59012,367,0072,872,0001,105,0002,117,632stderr
5Aug 29, 2026 09:191,59812,439,6872,872,0001,125,0002,117,632stderr
6Aug 29, 2026 09:191,65212,563,6493,022,0001,109,0002,117,632stderr
7Aug 29, 2026 09:191,67012,670,8443,050,0001,127,0002,117,632stderr
8Aug 29, 2026 09:191,67613,427,9283,055,0001,137,0002,117,632stderr
9Aug 29, 2026 09:191,68613,362,7873,057,0001,159,0002,117,632stderr