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 11:50Victor MerckléVictor MerckléScore: 2,542Success
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 11:522,51815,533,8784,964,0001,332,0002,113,536
2May 30, 2026 11:522,52215,454,0154,974,0001,332,0002,113,536
3May 30, 2026 11:522,52717,403,6574,982,0001,336,0002,113,536
4May 30, 2026 11:522,53815,265,5865,008,0001,337,0002,113,536
5May 30, 2026 11:522,54215,924,3015,020,0001,335,0002,113,536
6May 30, 2026 11:522,56416,377,7245,056,0001,354,0002,113,536
7May 30, 2026 11:522,59616,498,4945,123,0001,369,0002,113,536
8May 30, 2026 11:522,59817,310,6055,128,0001,369,0002,113,536
9May 30, 2026 11:522,63814,412,2485,262,0001,333,0002,113,536