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 09:06Victor MerckléVictor MerckléScore: 2,673Success
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 09:082,60316,221,8345,176,0001,333,0002,113,536
2May 30, 2026 09:082,61216,249,2555,197,0001,334,0002,113,536
3May 30, 2026 09:082,61515,169,5345,202,0001,337,0002,113,536
4May 30, 2026 09:082,64015,064,9365,251,0001,351,0002,113,536
5May 30, 2026 09:082,67314,955,9755,352,0001,332,0002,113,536
6May 30, 2026 09:082,68218,173,1955,378,0001,329,0002,113,536
7May 30, 2026 09:082,70215,502,1104,473,0002,283,0002,113,536
8May 30, 2026 09:082,70415,001,7755,434,0001,327,0002,113,536
9May 30, 2026 09:082,77016,641,7144,627,0002,299,0002,113,536