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 17, 2026 03:02M-RochatM-RochatScore: 4,417Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 03:034,29919,476,9839,687,0001,062,0002,121,728
2May 17, 2026 03:034,32319,519,9549,745,0001,064,0002,117,632
3May 17, 2026 03:034,32819,529,2079,755,0001,066,0002,121,728
4May 17, 2026 03:034,38419,651,4939,894,0001,068,0002,117,632
5May 17, 2026 03:034,41719,751,7599,971,0001,072,0002,121,728
6May 17, 2026 03:034,41819,788,8389,973,0001,074,0002,117,632
7May 17, 2026 03:034,41819,802,7049,973,0001,073,0002,117,632
8May 17, 2026 03:034,42419,741,9879,985,0001,077,0002,121,728
9May 17, 2026 03:034,42819,754,6649,996,0001,074,0002,117,632