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 15:41Victor MerckléVictor MerckléScore: 2,762Success
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 15:432,72214,972,3045,470,0001,336,0002,113,536
2May 20, 2026 15:432,73214,565,2345,489,0001,341,0002,113,536
3May 20, 2026 15:432,73216,110,6635,491,0001,340,0002,113,536
4May 20, 2026 15:432,73415,805,6515,494,0001,342,0002,113,536
5May 20, 2026 15:432,76214,679,9845,552,0001,355,0002,113,536
6May 20, 2026 15:432,78914,710,2615,604,0001,369,0002,113,536
7May 20, 2026 15:432,79216,253,4985,610,0001,370,0002,113,536
8May 20, 2026 15:432,89016,830,2785,876,0001,350,0002,113,536
9May 20, 2026 15:432,92216,876,2984,988,0002,318,0002,113,536