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 14, 2026 13:56Tomislav TunkovicTomislav TunkovicScore: 27,235Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 13:5727,12376,434,82356,288,00011,521,0002,117,632
2Aug 14, 2026 13:5727,23577,170,34956,116,00011,972,0002,117,632
3Aug 14, 2026 13:5727,50277,231,78855,994,00012,762,0002,117,632