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 11:33M-RochatM-RochatScore: 4,414Success
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 11:364,39419,659,5249,916,0001,070,0002,121,728
2May 17, 2026 11:364,39919,670,1349,929,0001,070,0002,117,632
3May 17, 2026 11:364,40219,708,5789,937,0001,070,0002,117,632
4May 17, 2026 11:364,40420,084,9429,939,0001,072,0002,117,632
5May 17, 2026 11:364,41419,660,2809,963,0001,073,0002,117,632
6May 17, 2026 11:364,42122,412,1529,981,0001,072,0002,117,632
7May 17, 2026 11:364,42319,713,2639,984,0001,074,0002,117,632
8May 17, 2026 11:364,42419,685,1049,986,0001,074,0002,117,632
9May 17, 2026 11:364,44119,843,40110,029,0001,074,0002,117,632