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 03:08olliecrowolliecrowScore: 4,768Success
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 03:084,76432,359,29311,910,00002,494,464
2Apr 17, 2026 03:084,76833,348,7678,940,0002,980,0002,301,952
3Apr 17, 2026 03:084,89328,530,09310,194,0002,038,0002,277,376