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 12:57M-RochatM-RochatScore: 4,441Success
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 12:574,43420,158,99810,008,0001,078,0002,117,632
2May 22, 2026 12:574,43620,167,23110,013,0001,078,0002,117,632
3May 22, 2026 12:574,43720,174,97710,016,0001,077,0002,117,632
4May 22, 2026 12:574,44020,262,65610,022,0001,079,0002,117,632
5May 22, 2026 12:574,44120,181,36110,024,0001,079,0002,117,632
6May 22, 2026 12:574,44620,197,97510,038,0001,079,0002,117,632
7May 22, 2026 12:574,44920,198,47910,046,0001,078,0002,117,632
8May 22, 2026 12:574,45620,253,71310,063,0001,079,0002,117,632
9May 22, 2026 12:574,46020,304,56710,071,0001,079,0002,121,728