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:54Tomislav TunkovicTomislav TunkovicScore: 1,720Success
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:551,59712,339,9833,994,0000528,384stderr
2Aug 15, 2026 16:551,59912,301,0583,999,0000528,384stderr
3Aug 15, 2026 16:551,60412,300,3154,010,0000528,384stderr
4Aug 15, 2026 16:551,60612,313,4634,016,0000528,384stderr
5Aug 15, 2026 16:551,72012,545,0634,300,0000528,384stderr
6Aug 15, 2026 16:551,72112,562,7654,303,0000528,384stderr
7Aug 15, 2026 16:551,72813,175,6104,320,0000528,384stderr
8Aug 15, 2026 16:551,73213,083,9054,330,0000528,384stderr
9Aug 15, 2026 16:551,79412,728,3023,292,0001,193,000528,384stderr