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:52izotoffizotoffScore: 34,774Success
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:5234,743113,208,39282,864,0003,993,0002,387,968
2Nov 14, 2025 17:5234,774118,039,31884,938,0001,998,0002,449,408
3Nov 14, 2025 17:5234,792113,253,42785,980,000999,0002,314,240