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:29Victor MerckléVictor MerckléScore: 2,579Success
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:312,53014,374,4274,996,0001,331,0002,113,536
2May 30, 2026 02:312,53314,622,2625,005,0001,329,0002,113,536
3May 30, 2026 02:312,55514,869,6455,041,0001,347,0002,113,536
4May 30, 2026 02:312,56614,981,2115,068,0001,348,0002,113,536
5May 30, 2026 02:312,57915,781,6805,125,0001,324,0002,113,536
6May 30, 2026 02:312,59514,251,5415,122,0001,366,0002,113,536
7May 30, 2026 02:312,61615,335,8765,211,0001,331,0002,113,536
8May 30, 2026 02:312,62215,311,5005,230,0001,325,0002,113,536
9May 30, 2026 02:312,63314,915,4875,252,0001,332,0002,113,536