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 22:03Andrew EpsteinAndrew EpsteinScore: 1,303Success
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 22:051,17612,149,1492,941,00002,117,632
2Nov 2, 2026 22:051,25612,318,7773,140,00002,117,632
3Nov 2, 2026 22:051,26413,898,4623,160,00002,117,632
4Nov 2, 2026 22:051,30212,367,9272,220,0001,036,0002,117,632
5Nov 2, 2026 22:051,30312,396,8722,241,0001,018,0002,117,632
6Nov 2, 2026 22:051,30812,913,0952,233,0001,039,0002,117,632
7Nov 2, 2026 22:051,31212,902,7372,264,0001,018,0002,117,632
8Nov 2, 2026 22:051,33513,192,6902,300,0001,039,0002,117,632
9Nov 2, 2026 22:051,43312,820,7162,570,0001,014,0002,117,632