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 listJun 13, 2026 23:04Victor MerckléVictor MerckléScore: 5,841Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 23:055,76123,548,48111,200,0003,204,0002,117,632
2Jun 13, 2026 23:055,77023,534,13311,201,0003,224,0002,117,632
3Jun 13, 2026 23:055,82623,786,27711,386,0003,179,0002,117,632
4Jun 13, 2026 23:055,83323,724,09711,316,0003,267,0002,117,632
5Jun 13, 2026 23:055,84123,790,19111,357,0003,246,0002,117,632
6Jun 13, 2026 23:056,16724,620,33112,199,0003,220,0002,117,632
7Jun 13, 2026 23:056,27625,985,54412,481,0003,209,0002,117,632
8Jun 13, 2026 23:056,29725,001,67912,533,0003,210,0002,117,632
9Jun 13, 2026 23:056,31924,964,52912,448,0003,351,0002,117,632