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 listMay 20, 2026 16:36M-RochatM-RochatScore: 4,565Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 16:364,55120,827,22610,289,0001,089,0002,117,632
2May 20, 2026 16:364,55220,677,38410,293,0001,089,0002,117,632
3May 20, 2026 16:364,55920,740,46510,312,0001,087,0002,117,632
4May 20, 2026 16:364,56520,890,67910,325,0001,089,0002,121,728
5May 20, 2026 16:364,56520,762,37710,324,0001,089,0002,117,632
6May 20, 2026 16:364,61220,896,52510,353,0001,177,0002,121,728
7May 20, 2026 16:364,68021,164,70710,601,0001,100,0002,117,632
8May 20, 2026 16:364,69621,441,70710,641,0001,099,0002,117,632
9May 20, 2026 16:364,70421,581,52810,660,0001,100,0002,121,728