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 02:26Victor MerckléVictor MerckléScore: 2,592Success
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 02:272,52614,087,6694,987,0001,329,0002,113,536
2May 30, 2026 02:272,53214,098,8985,001,0001,331,0002,113,536
3May 30, 2026 02:272,53415,761,5105,004,0001,332,0002,113,536
4May 30, 2026 02:272,54114,160,5045,021,0001,332,0002,113,536
5May 30, 2026 02:272,59214,293,2775,116,0001,364,0002,113,536
6May 30, 2026 02:272,61514,910,7025,212,0001,326,0002,113,536
7May 30, 2026 02:272,64016,180,3225,252,0001,348,0002,113,536
8May 30, 2026 02:272,64614,326,7115,268,0001,348,0002,113,536
9May 30, 2026 02:272,66514,235,8945,334,0001,329,0002,113,536