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 22, 2026 13:08M-RochatM-RochatScore: 4,317Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 13:084,29620,069,1649,679,0001,063,0002,117,632
2May 22, 2026 13:084,29719,927,0199,368,0001,376,0002,113,536
3May 22, 2026 13:084,30720,013,0289,706,0001,063,0002,113,536
4May 22, 2026 13:084,31020,053,4269,712,0001,064,0002,113,536
5May 22, 2026 13:084,31719,966,5329,728,0001,066,0002,113,536
6May 22, 2026 13:084,31820,135,7969,731,0001,065,0002,113,536
7May 22, 2026 13:084,31922,639,9019,731,0001,067,0002,121,728
8May 22, 2026 13:084,32219,989,1369,742,0001,064,0002,113,536
9May 22, 2026 13:084,32320,080,4279,746,0001,062,0002,113,536