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 01:14Victor MerckléVictor MerckléScore: 2,592Success
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 01:162,53814,711,5725,015,0001,331,0002,113,536
2May 30, 2026 01:162,53915,898,8945,016,0001,332,0002,113,536
3May 30, 2026 01:162,54216,286,9375,018,0001,337,0002,113,536
4May 30, 2026 01:162,54316,245,5185,026,0001,333,0002,113,536
5May 30, 2026 01:162,59214,287,2475,153,0001,329,0002,113,536
6May 30, 2026 01:162,62515,978,4905,231,0001,333,0002,113,536
7May 30, 2026 01:162,65216,649,3875,285,0001,345,0002,113,536
8May 30, 2026 01:162,66415,836,6805,315,0001,345,0002,113,536
9May 30, 2026 01:162,66815,929,2905,321,0001,351,0002,113,536