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 listMar 4, 2026 18:05olliecrowolliecrowScore: 25,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 18:0524,42184,349,89654,047,0007,006,0002,314,240
2Mar 4, 2026 18:0525,13893,687,62955,751,0007,095,0002,293,760
3Mar 4, 2026 18:0525,27893,302,52357,178,0006,018,0002,289,664