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 11, 2026 20:43Victor MerckléVictor MerckléScore: 3,910Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 20:443,86719,218,3797,427,0002,242,0002,138,112
2May 11, 2026 20:443,87019,346,7677,302,0002,373,0002,142,208
3May 11, 2026 20:443,88018,111,9697,440,0002,262,0002,142,208
4May 11, 2026 20:443,88419,099,6757,321,0002,391,0002,138,112
5May 11, 2026 20:443,91019,667,8617,350,0002,425,0002,142,208
6May 11, 2026 20:443,92719,825,0076,740,0003,079,0002,138,112
7May 11, 2026 20:443,92817,141,3626,584,0003,236,0002,142,208
8May 11, 2026 20:443,95119,728,4586,706,0003,172,0002,142,208
9May 11, 2026 20:444,06819,582,7997,808,0002,363,0002,138,112