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 listMay 15, 2026 19:32M-RochatM-RochatScore: 24,688Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 19:3224,67873,459,03559,685,0002,010,0002,117,632
2May 15, 2026 19:3224,68870,482,26759,705,0002,015,0002,117,632
3May 15, 2026 19:3224,76570,644,58659,870,0002,044,0002,117,632