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 29, 2026 21:54Victor MerckléVictor MerckléScore: 2,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 21:562,58615,157,4005,143,0001,324,0002,113,536
2May 29, 2026 21:562,59316,582,1095,158,0001,325,0002,113,536
3May 29, 2026 21:562,59315,217,1285,159,0001,325,0002,113,536
4May 29, 2026 21:562,59714,942,3745,170,0001,323,0002,113,536
5May 29, 2026 21:562,62416,040,3505,215,0001,345,0002,113,536
6May 29, 2026 21:562,65016,155,0225,272,0001,354,0002,113,536
7May 29, 2026 21:562,67816,219,5025,376,0001,321,0002,113,536
8May 29, 2026 21:562,69414,484,1215,412,0001,325,0002,113,536
9May 29, 2026 21:562,74918,275,7174,581,0002,292,0002,113,536