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 06:48Victor MerckléVictor MerckléScore: 2,625Success
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 06:492,54514,844,6425,028,0001,335,0002,113,536
2May 30, 2026 06:492,59814,095,4215,124,0001,372,0002,113,536
3May 30, 2026 06:492,60514,538,1205,179,0001,334,0002,113,536
4May 30, 2026 06:492,62414,292,1335,234,0001,328,0002,113,536
5May 30, 2026 06:492,62515,277,0285,233,0001,330,0002,113,536
6May 30, 2026 06:492,63016,446,7345,249,0001,326,0002,113,536
7May 30, 2026 06:492,64414,238,5155,274,0001,337,0002,113,536
8May 30, 2026 06:492,66414,862,4505,311,0001,349,0002,113,536
9May 30, 2026 06:492,67017,624,6585,323,0001,354,0002,113,536