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:46Victor MerckléVictor MerckléScore: 1,572Success
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:471,47512,536,1942,605,0001,083,0002,117,632stderr
2Sep 14, 2026 10:471,48312,351,7152,613,0001,095,0002,117,632stderr
3Sep 14, 2026 10:471,50720,579,5292,642,0001,127,0002,117,632stderr
4Sep 14, 2026 10:471,56712,629,6522,798,0001,120,0002,117,632stderr
5Sep 14, 2026 10:471,57212,566,9362,833,0001,097,0002,117,632stderr
6Sep 14, 2026 10:471,59214,077,1372,851,0001,131,0002,117,632stderr
7Sep 14, 2026 10:471,61212,740,7052,919,0001,111,0002,117,632stderr
8Sep 14, 2026 10:471,63712,653,7842,916,0001,178,0002,117,632stderr
9Sep 14, 2026 10:471,64612,553,9172,963,0001,152,0002,117,632stderr