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 6, 2026 14:23olliecrowolliecrowScore: 9,305Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 14:239,26446,743,59721,146,0002,013,0002,441,216
2Apr 6, 2026 14:239,30546,378,35317,194,0006,068,0002,510,848
3Apr 6, 2026 14:239,33948,249,98218,273,0005,075,0002,433,024