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 15:33Victor MerckléVictor MerckléScore: 1,490Success
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 15:351,40412,134,5722,430,0001,080,0002,117,632stderr
2Sep 14, 2026 15:351,43112,072,5382,489,0001,090,0002,117,632stderr
3Sep 14, 2026 15:351,44112,218,1822,503,0001,101,0002,117,632stderr
4Sep 14, 2026 15:351,48812,365,6482,632,0001,090,0002,117,632stderr
5Sep 14, 2026 15:351,49019,490,1442,606,0001,121,0002,117,632stderr
6Sep 14, 2026 15:351,51220,464,4582,644,0001,136,0002,117,632stderr
7Sep 14, 2026 15:351,51812,463,6052,640,0001,155,0002,117,632stderr
8Sep 14, 2026 15:351,52313,183,3502,661,0001,148,0002,117,632stderr
9Sep 14, 2026 15:351,54412,449,3172,647,0001,215,0002,117,632stderr