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:26Victor MerckléVictor MerckléScore: 3,132Success
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:273,02722,526,1366,487,0001,081,0002,465,792
2May 1, 2026 14:273,04826,123,7645,444,0002,177,0002,473,984
3May 1, 2026 14:273,04826,037,0647,620,00002,465,792
4May 1, 2026 14:273,05333,887,3053,271,0004,362,0002,465,792
5May 1, 2026 14:273,13222,884,9954,475,0003,356,0002,465,792
6May 1, 2026 14:273,13825,364,1675,605,0002,242,0002,469,888
7May 1, 2026 14:273,15826,971,9462,961,0004,935,0002,469,888
8May 1, 2026 14:273,18626,975,3883,983,0003,983,0002,465,792
9May 1, 2026 14:273,20821,717,1244,010,0004,010,0002,457,600