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 20:56Victor MerckléVictor MerckléScore: 2,561Success
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 20:582,53715,620,3105,018,0001,326,0002,113,536
2May 29, 2026 20:582,53716,318,8495,015,0001,329,0002,113,536
3May 29, 2026 20:582,54414,166,9705,035,0001,327,0002,113,536
4May 29, 2026 20:582,55217,193,1825,053,0001,328,0002,113,536
5May 29, 2026 20:582,56117,286,6165,072,0001,332,0002,113,536
6May 29, 2026 20:582,61015,995,0875,165,0001,362,0002,113,536
7May 29, 2026 20:582,64414,350,2745,274,0001,336,0002,113,536
8May 29, 2026 20:582,69014,529,8404,460,0002,267,0002,113,536
9May 29, 2026 20:582,70116,138,0984,489,0002,264,0002,113,536