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 16, 2026 23:09olliecrowolliecrowScore: 5,412Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 23:095,30634,330,0949,184,0004,082,0002,301,952
2Apr 16, 2026 23:095,41234,166,94210,408,0003,122,0002,383,872
3Apr 16, 2026 23:095,56430,772,36510,930,0002,981,0002,383,872