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 18:13Elijah KinElijah KinScore: 2,594Success
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 18:172,53415,329,6515,229,0001,108,0002,117,632
2Jun 4, 2026 18:172,55415,413,7245,250,0001,135,0002,117,632
3Jun 4, 2026 18:172,58515,434,5145,316,0001,147,0002,117,632
4Jun 4, 2026 18:172,58617,414,4255,311,0001,154,0002,117,632
5Jun 4, 2026 18:172,59415,484,4055,330,0001,155,0002,117,632
6Jun 4, 2026 18:172,60415,822,0855,363,0001,147,0002,117,632
7Jun 4, 2026 18:172,64517,891,2495,489,0001,125,0002,117,632
8Jun 4, 2026 18:172,69017,408,2505,578,0001,148,0002,117,632
9Jun 4, 2026 18:172,77415,913,3745,801,0001,134,0002,117,632