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 12, 2026 02:47olliecrowolliecrowScore: 8,680Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 02:478,63442,678,25719,531,0002,055,0002,412,544
2Mar 12, 2026 02:478,68049,616,14719,634,0002,066,0002,310,144
3Mar 12, 2026 02:478,69047,486,94120,691,0001,034,0002,519,040