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 listNov 14, 2025 17:47izotoffizotoffScore: 34,779Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2025 17:4734,768118,919,70485,921,000999,0002,314,240
2Nov 14, 2025 17:4734,779114,358,15684,950,0001,998,0002,400,256
3Nov 14, 2025 17:4734,781121,255,45383,955,0002,998,0002,326,528