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 30, 2026 07:33Victor MerckléVictor MerckléScore: 2,605Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 07:352,52114,117,3114,970,0001,334,0002,113,536
2May 30, 2026 07:352,52816,455,2824,989,0001,333,0002,113,536
3May 30, 2026 07:352,52916,304,2534,988,0001,335,0002,113,536
4May 30, 2026 07:352,53814,227,7415,008,0001,337,0002,113,536
5May 30, 2026 07:352,60516,157,9425,172,0001,341,0002,113,536
6May 30, 2026 07:352,62215,977,9594,273,0002,284,0002,113,536
7May 30, 2026 07:352,63914,275,4505,260,0001,339,0002,113,536
8May 30, 2026 07:352,65316,244,2755,249,0001,385,0002,113,536
9May 30, 2026 07:352,70714,794,7134,484,0002,285,0002,113,536