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 30, 2026 21:24Victor MerckléVictor MerckléScore: 1,550Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 21:281,47812,156,3072,621,0001,074,0002,117,632stderr
2Aug 30, 2026 21:281,48311,942,8812,626,0001,083,0002,117,632stderr
3Aug 30, 2026 21:281,48511,936,2582,615,0001,098,0002,117,632stderr
4Aug 30, 2026 21:281,50012,063,4642,629,0001,123,0002,117,632stderr
5Aug 30, 2026 21:281,55012,120,9242,752,0001,125,0002,117,632stderr
6Aug 30, 2026 21:281,57812,181,7342,843,0001,102,0002,117,632stderr
7Aug 30, 2026 21:281,58212,449,8872,849,0001,108,0002,117,632stderr
8Aug 30, 2026 21:281,58513,075,0662,852,0001,112,0002,117,632stderr
9Aug 30, 2026 21:281,66512,379,6483,033,0001,130,0002,117,632stderr