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 00:11Victor MerckléVictor MerckléScore: 2,582Success
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 00:132,52314,104,9214,974,0001,334,0002,113,536
2May 30, 2026 00:132,52617,352,6134,986,0001,330,0002,113,536
3May 30, 2026 00:132,57214,234,2735,098,0001,333,0002,113,536
4May 30, 2026 00:132,58016,295,0705,123,0001,328,0002,113,536
5May 30, 2026 00:132,58214,340,1565,121,0001,335,0002,113,536
6May 30, 2026 00:132,59016,255,4095,107,0001,368,0002,113,536
7May 30, 2026 00:132,59116,074,8085,108,0001,371,0002,113,536
8May 30, 2026 00:132,59514,867,8855,119,0001,370,0002,113,536
9May 30, 2026 00:132,66214,933,5065,307,0001,349,0002,113,536