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 03:27Victor MerckléVictor MerckléScore: 2,624Success
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 03:292,52314,085,7884,978,0001,331,0002,113,536
2May 30, 2026 03:292,53216,247,6894,996,0001,335,0002,113,536
3May 30, 2026 03:292,53216,487,0194,995,0001,335,0002,113,536
4May 30, 2026 03:292,58716,427,7175,099,0001,370,0002,113,536
5May 30, 2026 03:292,62414,755,0145,231,0001,330,0002,113,536
6May 30, 2026 03:292,62818,975,1505,238,0001,334,0002,113,536
7May 30, 2026 03:292,63814,365,2565,264,0001,331,0002,113,536
8May 30, 2026 03:292,68015,248,7044,429,0002,272,0002,113,536
9May 30, 2026 03:292,68814,524,4584,444,0002,278,0002,113,536