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 17, 2026 21:56Jacob McDanielJacob McDanielScore: 3,098Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 21:562,99518,302,3716,311,0001,177,0002,117,632
2May 17, 2026 21:563,00417,538,2946,331,0001,179,0002,117,632
3May 17, 2026 21:563,02517,736,0896,378,0001,185,0002,117,632
4May 17, 2026 21:563,02617,629,7436,380,0001,186,0002,117,632
5May 17, 2026 21:563,09817,060,1836,510,0001,237,0002,117,632
6May 17, 2026 21:563,13918,529,8596,586,0001,262,0002,117,632
7May 17, 2026 21:563,14317,457,2926,600,0001,259,0002,117,632
8May 17, 2026 21:563,14517,872,4416,618,0001,245,0002,117,632
9May 17, 2026 21:563,16817,092,5026,647,0001,275,0002,113,536