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 listNov 2, 2026 21:41Andrew EpsteinAndrew EpsteinScore: 16,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2026 21:4116,18849,667,60639,351,0001,121,0002,117,632stderr
2Nov 2, 2026 21:4116,19450,095,29239,377,0001,108,0002,117,632stderr
3Nov 2, 2026 21:4116,20849,734,96039,393,0001,128,0002,117,632stderr
4Nov 2, 2026 21:4116,22549,805,69939,444,0001,119,0002,117,632stderr
5Nov 2, 2026 21:4116,26450,267,97539,532,0001,130,0002,117,632stderr
6Nov 2, 2026 21:4116,26450,291,62039,461,0001,200,0002,117,632stderr
7Nov 2, 2026 21:4116,26649,941,96939,459,0001,207,0002,117,632stderr
8Nov 2, 2026 21:4116,26850,301,96439,543,0001,129,0002,117,632stderr
9Nov 2, 2026 21:4116,48459,172,78539,885,0001,325,0002,117,632stderr