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 listJul 7, 2026 20:48Victor MerckléVictor MerckléScore: 1,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 20:501,58413,398,7072,883,0001,078,0002,117,632stderr
2Jul 7, 2026 20:501,59112,025,8432,903,0001,076,0002,117,632stderr
3Jul 7, 2026 20:501,59211,997,4142,891,0001,090,0002,117,632stderr
4Jul 7, 2026 20:501,59512,036,1072,890,0001,098,0002,117,632stderr
5Jul 7, 2026 20:501,60011,996,0822,894,0001,108,0002,117,632stderr
6Jul 7, 2026 20:501,60412,042,2612,901,0001,111,0002,117,632stderr
7Jul 7, 2026 20:501,60912,055,0502,916,0001,108,0002,117,632stderr
8Jul 7, 2026 20:501,61012,035,6272,911,0001,115,0002,117,632stderr
9Jul 7, 2026 20:501,68412,253,7263,097,0001,113,0002,117,632stderr