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 19:21Charles CabergsCharles CabergsScore: 267,362Success
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 19:21267,242696,231,538662,106,0006,000,0002,482,176
2Apr 17, 2026 19:21267,286698,656,501665,216,0003,000,0002,314,240
3Apr 17, 2026 19:21267,298693,883,323665,244,0003,001,0002,293,760
4Apr 17, 2026 19:21267,298693,697,319663,244,0005,001,0002,506,752
5Apr 17, 2026 19:21267,362697,471,631665,403,0003,001,0002,486,272
6Apr 17, 2026 19:21267,794701,853,330664,489,0004,996,0002,486,272
7Apr 17, 2026 19:21267,874697,479,093664,687,0004,997,0002,449,408
8Apr 17, 2026 19:21267,876700,338,500666,691,0002,998,0002,310,144
9Apr 17, 2026 19:21268,101697,064,761667,257,0002,996,0002,306,048