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 listJan 1, 2026 18:50Josu San MartinJosu San MartinScore: 18,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 18:5018,51568,944,51640,250,0006,037,0002,306,048
2Jan 1, 2026 18:5018,53280,703,40842,301,0004,028,0002,449,408
3Jan 1, 2026 18:5018,69377,247,54342,670,0004,063,0002,453,504