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 16, 2026 23:05Jacob McDanielJacob McDanielScore: 11,248Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 23:0611,10139,437,46221,430,0006,324,0002,113,536
2May 16, 2026 23:0611,16236,716,41221,567,0006,340,0002,113,536
3May 16, 2026 23:0611,22139,220,71421,333,0006,720,0002,113,536
4May 16, 2026 23:0611,23237,879,02321,657,0006,424,0002,113,536
5May 16, 2026 23:0611,24837,599,51121,708,0006,414,0002,113,536
6May 16, 2026 23:0611,28137,549,13821,597,0006,607,0002,113,536
7May 16, 2026 23:0611,34138,446,73121,547,0006,807,0002,113,536
8May 16, 2026 23:0611,49037,827,01421,755,0006,972,0002,113,536
9May 16, 2026 23:0611,78838,404,96422,895,0006,575,0002,113,536