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 22, 2026 16:29Dominique GarmierDominique GarmierScore: 50,575Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 16:2949,999151,061,246117,998,0006,999,0002,527,232
2Mar 22, 2026 16:2950,575156,368,717120,418,0006,020,0002,420,736
3Mar 22, 2026 16:2950,913159,170,306121,269,0006,013,0002,355,200