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 30, 2026 03:52Victor MerckléVictor MerckléScore: 2,720Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 03:542,68814,488,0655,409,0001,311,0002,113,536
2May 30, 2026 03:542,69014,506,6365,420,0001,305,0002,113,536
3May 30, 2026 03:542,69914,604,5825,439,0001,309,0002,113,536
4May 30, 2026 03:542,70017,805,1935,443,0001,309,0002,113,536
5May 30, 2026 03:542,72015,525,5195,476,0001,324,0002,113,536
6May 30, 2026 03:542,77914,785,4365,640,0001,308,0002,113,536
7May 30, 2026 03:542,80015,368,9485,681,0001,319,0002,113,536
8May 30, 2026 03:542,84814,896,6914,859,0002,263,0002,113,536
9May 30, 2026 03:542,92515,597,2564,859,0002,454,0002,113,536