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 16, 2026 23:10M-RochatM-RochatScore: 5,646Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 23:115,55422,613,24512,754,0001,132,0002,117,632
2May 16, 2026 23:115,64122,786,02011,967,0002,137,0002,117,632
3May 16, 2026 23:115,64422,801,55511,956,0002,155,0002,117,632
4May 16, 2026 23:115,64522,565,61311,981,0002,132,0002,117,632
5May 16, 2026 23:115,64622,718,76711,987,0002,130,0002,117,632
6May 16, 2026 23:115,65922,884,89011,974,0002,174,0002,117,632
7May 16, 2026 23:115,66022,867,22211,978,0002,172,0002,117,632
8May 16, 2026 23:115,66825,283,59711,974,0002,197,0002,117,632
9May 16, 2026 23:115,66922,874,72911,957,0002,216,0002,117,632