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 20, 2026 17:16A_ShamanA_ShamanScore: 50,809Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 17:1650,620135,804,295124,513,0002,037,0002,117,632
2Jun 20, 2026 17:1650,624135,758,333124,526,0002,035,0002,117,632
3Jun 20, 2026 17:1650,630135,930,826124,545,0002,030,0002,117,632
4Jun 20, 2026 17:1650,688135,951,764124,552,0002,168,0002,117,632
5Jun 20, 2026 17:1650,809136,406,725124,979,0002,044,0002,117,632
6Jun 20, 2026 17:1651,555138,046,440126,856,0002,032,0002,117,632
7Jun 20, 2026 17:1651,765139,005,334127,352,0002,061,0002,117,632
8Jun 20, 2026 17:1651,928139,520,956127,694,0002,128,0002,117,632
9Jun 20, 2026 17:1651,944142,396,877127,826,0002,034,0002,117,632