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 4, 2026 08:06Victor MerckléVictor MerckléScore: 1,480Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 08:201,41612,042,1442,493,0001,047,0002,117,632stderr
2Sep 4, 2026 08:201,45311,876,4682,567,0001,066,0002,117,632stderr
3Sep 4, 2026 08:201,45712,068,8612,565,0001,079,0002,117,632stderr
4Sep 4, 2026 08:201,46411,937,8172,571,0001,091,0002,117,632stderr
5Sep 4, 2026 08:201,48012,182,7442,606,0001,095,0002,117,632stderr
6Sep 4, 2026 08:201,48611,936,5672,531,0001,184,0002,117,632stderr
7Sep 4, 2026 08:201,51412,256,0582,674,0001,112,0002,117,632stderr
8Sep 4, 2026 08:201,53012,147,3562,698,0001,129,0002,117,632stderr
9Sep 4, 2026 08:201,62513,100,9702,938,0001,126,0002,117,632stderr