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 20, 2026 10:46Jacob McDanielJacob McDanielScore: 2,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 10:472,74816,233,4035,734,0001,138,0002,117,632
2May 20, 2026 10:472,77416,633,7355,697,0001,240,0002,117,632
3May 20, 2026 10:472,79118,301,1845,748,0001,230,0002,117,632
4May 20, 2026 10:472,85017,844,8035,876,0001,251,0002,117,632
5May 20, 2026 10:472,86218,581,2425,917,0001,240,0002,117,632
6May 20, 2026 10:472,86817,917,1325,896,0001,275,0002,117,632
7May 20, 2026 10:472,86916,464,0425,909,0001,264,0002,117,632
8May 20, 2026 10:472,89119,430,3245,970,0001,259,0002,117,632
9May 20, 2026 10:472,90918,571,8515,996,0001,277,0002,117,632