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 listFeb 5, 2026 04:15Josu San MartinJosu San MartinScore: 5,565Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 04:155,55842,555,4609,926,0003,970,0002,367,488
2Feb 5, 2026 04:155,56531,049,03310,931,0002,981,0002,396,160
3Feb 5, 2026 04:155,62029,720,73411,039,0003,010,0002,400,256