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 listSep 15, 2026 00:10Victor MerckléVictor MerckléScore: 1,391Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 00:141,35812,184,1451,871,0001,524,0002,117,632stderr
2Sep 15, 2026 00:141,37212,077,6022,318,0001,114,0002,117,632stderr
3Sep 15, 2026 00:141,38212,181,4311,916,0001,540,0002,117,632stderr
4Sep 15, 2026 00:141,38812,104,9461,917,0001,554,0002,117,632stderr
5Sep 15, 2026 00:141,39112,169,2891,922,0001,557,0002,117,632stderr
6Sep 15, 2026 00:141,46412,479,1612,140,0001,521,0002,117,632stderr
7Sep 15, 2026 00:141,49212,479,2812,194,0001,536,0002,117,632stderr
8Sep 15, 2026 00:141,50112,310,5602,585,0001,169,0002,117,632stderr
9Sep 15, 2026 00:141,50612,489,9012,185,0001,580,0002,117,632stderr