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 03:01olliecrowolliecrowScore: 10,774Success
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 03:0110,77051,143,59324,932,0001,994,0002,510,848
2Mar 12, 2026 03:0110,77459,490,61323,942,0002,992,0002,408,448
3Mar 12, 2026 03:0111,07754,376,99724,616,0003,077,0002,404,352