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 19, 2026 09:04olliecrowolliecrowScore: 4,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 09:044,76632,811,7239,929,0001,985,0002,428,928
2Apr 19, 2026 09:044,92228,481,88710,255,0002,051,0002,310,144
3Apr 19, 2026 09:044,95529,231,16310,324,0002,064,0002,297,856