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 listJun 10, 2026 23:35Victor MerckléVictor MerckléScore: 3,028Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 23:362,88216,005,8414,592,0002,615,0002,142,208
2Jun 10, 2026 23:362,90516,573,9104,430,0002,834,0002,142,208
3Jun 10, 2026 23:362,91018,193,3844,527,0002,750,0002,138,112
4Jun 10, 2026 23:362,97716,130,5284,685,0002,758,0002,142,208
5Jun 10, 2026 23:363,02816,841,8525,090,0002,482,0002,142,208
6Jun 10, 2026 23:363,03616,899,8384,212,0003,378,0002,142,208
7Jun 10, 2026 23:363,04516,434,9475,101,0002,513,0002,142,208
8Jun 10, 2026 23:363,04616,561,9765,008,0002,608,0002,142,208
9Jun 10, 2026 23:363,09716,838,7325,039,0002,704,0002,142,208