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 7, 2026 02:52Josu San MartinJosu San MartinScore: 27,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 04:0812,88262,089,58426,167,0006,038,0002,433,024
2Jan 7, 2026 04:0812,90159,527,95126,206,0006,047,0002,437,120
3Jan 7, 2026 04:0812,94258,476,50127,299,0005,055,0002,396,160
4Jan 7, 2026 02:5227,69094,576,64966,217,0003,009,0002,482,176
5Jan 7, 2026 02:5227,75791,732,96961,347,0008,045,0002,465,792
6Jan 7, 2026 02:5227,86091,297,84765,614,0004,037,0002,334,720