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 listApr 9, 2026 15:47olliecrowolliecrowScore: 5,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2026 15:475,63431,764,30313,080,0001,006,0002,273,280
2Apr 9, 2026 15:475,75033,278,90013,348,0001,026,0002,314,240
3Apr 9, 2026 15:475,88337,723,09212,606,0002,101,0002,420,736