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:42Victor MerckléVictor MerckléScore: 2,590Success
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:442,52113,868,0614,973,0001,330,0002,113,536
2May 30, 2026 00:442,52616,394,9754,983,0001,334,0002,113,536
3May 30, 2026 00:442,53215,377,7914,997,0001,333,0002,113,536
4May 30, 2026 00:442,54014,131,3945,019,0001,332,0002,113,536
5May 30, 2026 00:442,59014,579,5515,108,0001,367,0002,113,536
6May 30, 2026 00:442,62015,191,0845,223,0001,328,0002,113,536
7May 30, 2026 00:442,62415,450,3935,227,0001,333,0002,113,536
8May 30, 2026 00:442,66715,018,4405,305,0001,364,0002,113,536
9May 30, 2026 00:442,67914,603,4774,411,0002,288,0002,113,536