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 19, 2026 09:07Jacob McDanielJacob McDanielScore: 2,761Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 09:082,66215,888,4795,448,0001,209,0002,117,632
2May 19, 2026 09:082,67018,114,2805,471,0001,204,0002,117,632
3May 19, 2026 09:082,73016,198,8215,553,0001,273,0002,117,632
4May 19, 2026 09:082,74217,518,8325,583,0001,272,0002,117,632
5May 19, 2026 09:082,76116,726,2405,634,0001,269,0002,117,632
6May 19, 2026 09:082,76230,253,9755,766,0001,140,0002,117,632
7May 19, 2026 09:082,78418,172,0055,692,0001,268,0002,117,632
8May 19, 2026 09:082,79017,147,0805,718,0001,259,0002,117,632
9May 19, 2026 09:082,80819,374,7295,745,0001,275,0002,117,632