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 listSep 15, 2026 18:15Josu San MartinJosu San MartinScore: 2,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 18:152,73915,533,8185,744,0001,105,0002,117,632
2Sep 15, 2026 18:152,74315,580,1395,753,0001,105,0002,117,632
3Sep 15, 2026 18:152,74515,606,1275,757,0001,106,0002,117,632
4Sep 15, 2026 18:152,75015,631,9875,769,0001,107,0002,117,632
5Sep 15, 2026 18:152,79015,656,0985,850,0001,126,0002,117,632
6Sep 15, 2026 18:152,81617,294,3425,918,0001,122,0002,117,632
7Sep 15, 2026 18:152,82515,738,8575,942,0001,122,0002,117,632
8Sep 15, 2026 18:152,83015,663,7745,952,0001,124,0002,117,632
9Sep 15, 2026 18:153,06816,291,2756,563,0001,109,0002,117,632