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 17, 2026 01:37olliecrowolliecrowScore: 4,751Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 01:374,48737,732,81510,198,0001,019,0002,486,272
2Apr 17, 2026 01:374,75125,974,6199,899,0001,979,0002,486,272
3Apr 17, 2026 01:374,77028,117,5349,938,0001,987,0002,478,080