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 20, 2026 12:36Victor MerckléVictor MerckléScore: 2,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 12:372,79614,721,7325,868,0001,124,0002,113,536
2May 20, 2026 12:372,81914,808,5875,921,0001,128,0002,113,536
3May 20, 2026 12:372,82214,813,6415,923,0001,134,0002,113,536
4May 20, 2026 12:372,86117,092,8256,016,0001,138,0002,113,536
5May 20, 2026 12:372,89215,017,1036,095,0001,135,0002,113,536
6May 20, 2026 12:372,90017,913,2535,247,0002,004,0002,113,536
7May 20, 2026 12:372,94616,692,7596,233,0001,133,0002,113,536
8May 20, 2026 12:372,95217,879,4306,245,0001,137,0002,113,536
9May 20, 2026 12:373,00216,610,5656,362,0001,144,0002,113,536