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 26, 2026 18:14Kevin HeaveyKevin HeaveyScore: 1,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 18:151,19113,730,9292,978,0000524,288
2Sep 26, 2026 18:151,28113,115,4513,204,0000524,288
3Sep 26, 2026 18:151,28614,255,2943,217,0000524,288
4Sep 26, 2026 18:151,28614,286,3993,216,0000524,288
5Sep 26, 2026 18:151,28914,091,2243,224,0000524,288
6Sep 26, 2026 18:151,29014,301,1053,227,0000524,288
7Sep 26, 2026 18:151,29214,366,0243,230,0000524,288
8Sep 26, 2026 18:151,30013,226,5143,250,0000524,288
9Sep 26, 2026 18:151,30613,953,0683,267,0000524,288