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 10:14Victor MerckléVictor MerckléScore: 2,621Success
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 10:162,52614,701,4294,987,0001,329,0002,113,536
2May 30, 2026 10:162,53114,059,9804,997,0001,331,0002,113,536
3May 30, 2026 10:162,54013,953,2395,018,0001,332,0002,113,536
4May 30, 2026 10:162,54715,142,7055,030,0001,338,0002,113,536
5May 30, 2026 10:162,62116,316,0554,281,0002,272,0002,113,536
6May 30, 2026 10:162,63114,981,1675,255,0001,324,0002,113,536
7May 30, 2026 10:162,64314,398,2125,276,0001,333,0002,113,536
8May 30, 2026 10:162,66414,387,0675,311,0001,350,0002,113,536
9May 30, 2026 10:162,66514,958,8705,316,0001,348,0002,113,536