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 21, 2026 05:08Jacob McDanielJacob McDanielScore: 2,499Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 05:082,43617,466,8464,887,0001,204,0002,117,632
2May 21, 2026 05:082,43816,354,9224,890,0001,206,0002,117,632
3May 21, 2026 05:082,44017,064,1554,895,0001,205,0002,117,632
4May 21, 2026 05:082,45017,117,2674,917,0001,209,0002,117,632
5May 21, 2026 05:082,49915,785,4025,018,0001,231,0002,117,632
6May 21, 2026 05:082,53517,955,7675,084,0001,254,0002,117,632
7May 21, 2026 05:082,55316,464,2395,113,0001,270,0002,117,632
8May 21, 2026 05:082,55317,620,3215,110,0001,273,0002,117,632
9May 21, 2026 05:082,58017,838,4295,164,0001,287,0002,117,632