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 12:28M-RochatM-RochatScore: 4,407Success
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 12:284,28219,437,7869,646,0001,060,0002,117,632
2May 17, 2026 12:284,29319,476,4409,673,0001,060,0002,121,728
3May 17, 2026 12:284,29519,476,0709,678,0001,061,0002,113,536
4May 17, 2026 12:284,40519,776,3369,941,0001,073,0002,121,728
5May 17, 2026 12:284,40719,773,7459,949,0001,070,0002,121,728
6May 17, 2026 12:284,40919,670,3899,951,0001,073,0002,113,536
7May 17, 2026 12:284,41419,723,7529,967,0001,070,0002,117,632
8May 17, 2026 12:284,41519,719,9919,968,0001,070,0002,113,536
9May 17, 2026 12:284,41919,919,3699,976,0001,072,0002,117,632