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 2, 2026 02:36Victor MerckléVictor MerckléScore: 2,331Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 02:382,24213,247,6394,367,0001,240,0002,113,536
2Jun 2, 2026 02:382,24413,258,2614,377,0001,235,0002,113,536
3Jun 2, 2026 02:382,31313,475,2834,528,0001,255,0002,113,536
4Jun 2, 2026 02:382,31713,412,7724,557,0001,236,0002,113,536
5Jun 2, 2026 02:382,33113,437,1274,585,0001,244,0002,113,536
6Jun 2, 2026 02:382,33413,718,5814,583,0001,252,0002,113,536
7Jun 2, 2026 02:382,34016,566,7144,601,0001,249,0002,113,536
8Jun 2, 2026 02:382,34315,577,8394,610,0001,249,0002,113,536
9Jun 2, 2026 02:382,38813,733,3003,837,0002,135,0002,113,536