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 listApr 17, 2026 22:29Charles CabergsCharles CabergsScore: 24,834Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 22:2924,13986,679,45455,319,0005,029,0002,367,488
2Apr 17, 2026 22:2924,15486,592,60455,354,0005,032,0002,273,280
3Apr 17, 2026 22:2924,31189,977,73654,799,0005,978,0002,265,088
4Apr 17, 2026 22:2924,35090,723,48956,883,0003,991,0002,420,736
5Apr 17, 2026 22:2924,83487,490,89753,074,0009,012,0002,269,184
6Apr 17, 2026 22:2924,92686,625,07355,281,0007,035,0002,371,584
7Apr 17, 2026 22:2925,01085,198,57355,465,0007,059,0002,269,184
8Apr 17, 2026 22:2925,27283,085,47554,155,0009,025,0002,355,200
9Apr 17, 2026 22:2925,28190,772,09455,177,0008,025,0002,363,392