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 6, 2026 00:50Josu San MartinJosu San MartinScore: 5,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2026 00:505,64826,289,14810,086,0004,034,0002,400,256
2Feb 6, 2026 00:505,65041,908,2429,080,0005,044,0002,301,952
3Feb 6, 2026 00:505,66333,671,91710,113,0004,045,0002,396,160