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 listMay 18, 2026 04:31M-RochatM-RochatScore: 4,522Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 04:314,51220,498,85410,202,0001,079,0002,121,728
2May 18, 2026 04:314,51820,601,03210,213,0001,082,0002,121,728
3May 18, 2026 04:314,52020,644,19910,221,0001,080,0002,117,632
4May 18, 2026 04:314,52120,502,76210,225,0001,079,0002,117,632
5May 18, 2026 04:314,52220,692,27610,221,0001,084,0002,117,632
6May 18, 2026 04:314,52520,574,98510,234,0001,080,0002,117,632
7May 18, 2026 04:314,52620,510,57410,235,0001,081,0002,117,632
8May 18, 2026 04:314,52620,639,89610,238,0001,079,0002,117,632
9May 18, 2026 04:314,60620,679,63010,432,0001,083,0002,117,632