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:12Victor MerckléVictor MerckléScore: 2,541Success
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:142,53415,977,9405,003,0001,333,0002,113,536
2May 30, 2026 03:142,53514,118,9775,005,0001,334,0002,113,536
3May 30, 2026 03:142,53515,473,8665,009,0001,329,0002,113,536
4May 30, 2026 03:142,53516,341,4495,008,0001,330,0002,113,536
5May 30, 2026 03:142,54115,770,3035,021,0001,332,0002,113,536
6May 30, 2026 03:142,54317,206,7185,022,0001,337,0002,113,536
7May 30, 2026 03:142,55514,153,7425,040,0001,348,0002,113,536
8May 30, 2026 03:142,69614,963,3824,455,0002,285,0002,113,536
9May 30, 2026 03:142,69914,501,1054,467,0002,282,0002,113,536