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:00M-RochatM-RochatScore: 4,412Success
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:024,33619,621,9899,779,0001,063,0002,113,536
2May 17, 2026 03:024,39919,721,7219,928,0001,070,0002,117,632
3May 17, 2026 03:024,40819,694,9879,947,0001,074,0002,117,632
4May 17, 2026 03:024,40919,721,2989,951,0001,072,0002,121,728
5May 17, 2026 03:024,41219,702,4849,961,0001,071,0002,117,632
6May 17, 2026 03:024,41219,703,7999,957,0001,073,0002,117,632
7May 17, 2026 03:024,41919,757,8779,975,0001,074,0002,117,632
8May 17, 2026 03:024,42419,806,4879,990,0001,071,0002,117,632
9May 17, 2026 03:024,42619,706,1179,990,0001,077,0002,117,632