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 listApr 12, 2026 04:26limanjun99limanjun99Score: 754,398Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 04:26754,2851,914,313,9091,884,714,000999,0002,285,568
2Apr 12, 2026 04:26754,3511,910,793,9661,883,879,0001,998,0002,301,952
3Apr 12, 2026 04:26754,3751,910,951,4131,883,939,0001,998,0002,297,856
4Apr 12, 2026 04:26754,3931,915,897,7471,883,984,0001,998,0002,297,856
5Apr 12, 2026 04:26754,3981,914,337,4611,883,996,0001,998,0002,285,568
6Apr 12, 2026 04:26754,8951,913,322,6741,885,239,0001,998,0002,285,568
7Apr 12, 2026 04:26755,0411,919,836,4041,886,603,000999,0002,293,760
8Apr 12, 2026 04:26755,0461,916,789,4051,887,615,00002,301,952
9Apr 12, 2026 04:26755,0511,915,051,8401,885,630,0001,998,0002,293,760