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 3, 2026 07:16Elijah KinElijah KinScore: 4,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 07:184,86021,205,5569,923,0002,228,0002,117,632
2Jun 3, 2026 07:184,86121,114,0729,918,0002,236,0002,117,632
3Jun 3, 2026 07:184,87221,566,1059,951,0002,229,0002,113,536
4Jun 3, 2026 07:184,87421,233,6909,951,0002,235,0002,113,536
5Jun 3, 2026 07:184,88121,222,3829,962,0002,242,0002,113,536
6Jun 3, 2026 07:184,88421,242,4119,966,0002,244,0002,117,632
7Jun 3, 2026 07:185,46623,207,11010,521,0003,145,0002,113,536
8Jun 3, 2026 07:185,50023,208,57810,532,0003,219,0002,113,536
9Jun 3, 2026 07:185,55223,352,30410,614,0003,268,0002,117,632