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 4, 2026 08:38Elijah KinElijah KinScore: 7,328Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2026 08:387,28427,392,86814,867,0003,343,0002,117,632
2Jun 4, 2026 08:387,29827,400,93914,876,0003,370,0002,117,632
3Jun 4, 2026 08:387,31927,439,08014,912,0003,386,0002,117,632
4Jun 4, 2026 08:387,32827,483,32714,944,0003,378,0002,117,632
5Jun 4, 2026 08:387,32827,483,72314,939,0003,383,0002,117,632
6Jun 4, 2026 08:387,33027,416,84514,918,0003,408,0002,117,632
7Jun 4, 2026 08:387,34027,451,77314,873,0003,477,0002,117,632
8Jun 4, 2026 08:387,35927,562,24015,040,0003,358,0002,117,632
9Jun 4, 2026 08:387,39129,133,53415,042,0003,437,0002,117,632