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 listMar 4, 2026 18:49olliecrowolliecrowScore: 18,812Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 18:4918,78169,894,91439,960,0006,993,0002,785,280
2Mar 4, 2026 18:4918,81270,184,43040,026,0007,004,0002,920,448
3Mar 4, 2026 18:4918,82069,743,78440,044,0007,007,0002,916,352