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 listAug 27, 2026 22:48Elijah KinElijah KinScore: 2,295Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 22:492,20915,278,7264,270,0001,253,0002,117,632
2Aug 27, 2026 22:492,22615,330,6484,311,0001,256,0002,117,632
3Aug 27, 2026 22:492,26915,507,4444,422,0001,252,0002,117,632
4Aug 27, 2026 22:492,28415,441,1404,461,0001,249,0002,117,632
5Aug 27, 2026 22:492,29515,466,9614,471,0001,267,0002,117,632
6Aug 27, 2026 22:492,32115,938,7864,548,0001,256,0002,117,632
7Aug 27, 2026 22:492,32416,765,3474,546,0001,265,0002,117,632
8Aug 27, 2026 22:492,32516,356,2114,553,0001,261,0002,117,632
9Aug 27, 2026 22:492,35615,636,6244,614,0001,277,0002,117,632