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 1, 2026 14:19Victor MerckléVictor MerckléScore: 3,146Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 14:203,01823,806,7415,391,0002,156,0002,465,792
2May 1, 2026 14:203,03027,680,2966,494,0001,082,0002,461,696
3May 1, 2026 14:203,04229,523,4965,432,0002,173,0002,461,696
4May 1, 2026 14:203,05124,281,4165,449,0002,179,0002,453,504
5May 1, 2026 14:203,14626,060,9955,900,0001,966,0002,465,792
6May 1, 2026 14:203,14923,410,9834,921,0002,952,0002,469,888
7May 1, 2026 14:203,16026,884,6484,939,0002,963,0002,465,792
8May 1, 2026 14:203,16726,346,6314,949,0002,969,0002,461,696
9May 1, 2026 14:203,16922,682,7414,952,0002,971,0002,457,600