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 15, 2026 09:55Tomislav TunkovicTomislav TunkovicScore: 2,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 09:562,69615,170,7325,458,0001,283,0002,121,728
2Aug 15, 2026 09:562,69915,155,0425,462,0001,287,0002,121,728
3Aug 15, 2026 09:562,70315,203,5985,474,0001,284,0002,121,728
4Aug 15, 2026 09:562,71715,284,9235,477,0001,317,0002,121,728
5Aug 15, 2026 09:562,73115,051,8955,493,0001,335,0002,121,728
6Aug 15, 2026 09:562,77415,377,6025,628,0001,309,0002,117,632
7Aug 15, 2026 09:562,78315,338,4605,638,0001,320,0002,121,728
8Aug 15, 2026 09:562,87815,607,0385,883,0001,314,0002,121,728
9Aug 15, 2026 09:562,87815,445,4116,072,0001,125,0002,121,728