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 16:58Tomislav TunkovicTomislav TunkovicScore: 2,014Success
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 16:582,00313,351,6665,008,0000528,384stderr
2Aug 15, 2026 16:582,00713,379,4285,019,0000528,384stderr
3Aug 15, 2026 16:582,01213,389,0575,031,0000528,384stderr
4Aug 15, 2026 16:582,01313,352,0255,034,0000528,384stderr
5Aug 15, 2026 16:582,01413,347,4985,037,0000528,384stderr
6Aug 15, 2026 16:582,13713,631,8895,344,0000528,384stderr
7Aug 15, 2026 16:582,13813,698,1065,347,0000528,384stderr
8Aug 15, 2026 16:582,14113,678,1285,354,0000528,384stderr
9Aug 15, 2026 16:582,14313,633,9285,358,0000528,384stderr