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:52Victor MerckléVictor MerckléScore: 4,221Success
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:554,13019,422,9257,102,0003,223,0002,134,016
2May 11, 2026 20:554,15818,972,8186,982,0003,413,0002,142,208
3May 11, 2026 20:554,16919,124,7017,169,0003,254,0002,142,208
4May 11, 2026 20:554,21019,764,2627,145,0003,381,0002,142,208
5May 11, 2026 20:554,22119,212,2027,200,0003,353,0002,142,208
6May 11, 2026 20:554,25119,241,6557,209,0003,419,0002,134,016
7May 11, 2026 20:554,25919,252,3707,175,0003,473,0002,138,112
8May 11, 2026 20:554,26221,418,7707,230,0003,427,0002,134,016
9May 11, 2026 20:554,27019,321,4447,226,0003,451,0002,134,016