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 19, 2026 14:14Elijah KinElijah KinScore: 10,286Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 14:1610,04135,317,95522,012,0003,091,0002,113,536
2May 19, 2026 14:1610,04535,887,38922,971,0002,142,0002,113,536
3May 19, 2026 14:1610,04634,484,50522,975,0002,142,0002,113,536
4May 19, 2026 14:1610,05636,678,47321,924,0003,218,0002,113,536
5May 19, 2026 14:1610,28638,089,34322,505,0003,210,0002,113,536
6May 19, 2026 14:1610,32137,788,90022,691,0003,113,0002,113,536
7May 19, 2026 14:1610,32835,809,50722,582,0003,240,0002,113,536
8May 19, 2026 14:1610,36635,734,02022,699,0003,216,0002,113,536
9May 19, 2026 14:1610,40035,328,04922,623,0003,379,0002,113,536