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 16:25Victor MerckléVictor MerckléScore: 2,658Success
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 16:272,55815,569,0765,086,0001,309,0002,113,536
2May 29, 2026 16:272,58016,191,4665,135,0001,316,0002,113,536
3May 29, 2026 16:272,58014,608,0315,135,0001,316,0002,113,536
4May 29, 2026 16:272,59214,461,5865,158,0001,324,0002,113,536
5May 29, 2026 16:272,65814,439,2105,338,0001,309,0002,113,536
6May 29, 2026 16:272,69014,465,7405,416,0001,311,0002,113,536
7May 29, 2026 16:272,69816,403,6985,430,0001,317,0002,113,536
8May 29, 2026 16:272,71317,705,9835,471,0001,313,0002,113,536
9May 29, 2026 16:272,75015,218,7855,539,0001,336,0002,113,536