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 02:27olliecrowolliecrowScore: 4,791Success
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 02:274,51825,075,3108,214,0003,080,0002,428,928
2Apr 17, 2026 02:274,62130,092,0568,402,0003,150,0002,408,448
3Apr 17, 2026 02:274,77033,209,8759,939,0001,987,0002,424,832
4Apr 17, 2026 02:274,79129,510,7489,982,0001,996,0002,412,544
5Apr 17, 2026 02:274,85633,696,75210,118,0002,023,0002,412,544
6Apr 17, 2026 02:274,91433,030,27211,261,0001,023,0002,424,832