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 listApr 30, 2026 19:16Victor MerckléVictor MerckléScore: 6,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 19:176,76233,805,04011,935,0004,972,0002,387,968
2Apr 30, 2026 19:176,78334,688,74712,969,0003,990,0002,400,256
3Apr 30, 2026 19:176,79232,252,55611,987,0004,994,0002,392,064
4Apr 30, 2026 19:176,81332,211,07713,026,0004,008,0002,297,856
5Apr 30, 2026 19:176,91333,237,84913,217,0004,066,0002,387,968
6Apr 30, 2026 19:176,91436,004,75511,186,0006,101,0002,392,064
7Apr 30, 2026 19:176,94134,821,55912,250,0005,104,0002,387,968
8Apr 30, 2026 19:176,94433,510,26113,276,0004,084,0002,392,064
9Apr 30, 2026 19:177,13739,853,26710,904,0006,939,0002,396,160