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 18, 2026 05:50Jacob McDanielJacob McDanielScore: 2,856Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 05:592,76016,761,2545,731,0001,169,0002,117,632
2May 18, 2026 05:592,78618,218,1145,786,0001,179,0002,117,632
3May 18, 2026 05:592,78916,176,2615,795,0001,179,0002,117,632
4May 18, 2026 05:592,80917,267,3785,833,0001,191,0002,117,632
5May 18, 2026 05:592,85618,118,4635,877,0001,264,0002,117,632
6May 18, 2026 05:592,86617,307,5325,894,0001,271,0002,117,632
7May 18, 2026 05:592,87718,257,0605,946,0001,248,0002,117,632
8May 18, 2026 05:592,89119,514,9405,942,0001,286,0002,117,632
9May 18, 2026 05:592,90617,619,9205,998,0001,268,0002,117,632