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 20, 2026 16:51M-RochatM-RochatScore: 4,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 16:514,56021,155,78210,311,0001,089,0002,117,632
2May 20, 2026 16:514,56320,866,90010,319,0001,090,0002,117,632
3May 20, 2026 16:514,56920,778,22410,333,0001,091,0002,121,728
4May 20, 2026 16:514,64120,945,9169,574,0002,029,0002,117,632
5May 20, 2026 16:514,67520,921,17610,590,0001,098,0002,117,632
6May 20, 2026 16:514,67820,949,51610,597,0001,098,0002,117,632
7May 20, 2026 16:514,68021,344,06510,604,0001,098,0002,121,728
8May 20, 2026 16:514,69621,557,43810,641,0001,100,0002,117,632
9May 20, 2026 16:514,71821,181,84910,699,0001,098,0002,117,632