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 1, 2026 18:40Victor MerckléVictor MerckléScore: 2,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 18:422,51413,824,1194,954,0001,332,0002,113,536
2Jun 1, 2026 18:422,54213,910,7645,028,0001,329,0002,113,536
3Jun 1, 2026 18:422,54613,907,5915,016,0001,349,0002,113,536
4Jun 1, 2026 18:422,59614,127,1675,161,0001,331,0002,113,536
5Jun 1, 2026 18:422,60014,053,5525,170,0001,331,0002,113,536
6Jun 1, 2026 18:422,60413,936,0575,176,0001,335,0002,113,536
7Jun 1, 2026 18:422,60914,040,6155,191,0001,333,0002,113,536
8Jun 1, 2026 18:422,61814,073,9125,213,0001,334,0002,113,536
9Jun 1, 2026 18:422,66114,110,7665,288,0001,366,0002,113,536