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 30, 2026 18:42Victor MerckléVictor MerckléScore: 1,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 18:441,60012,019,3302,860,0001,142,0002,117,632stderr
2Jun 30, 2026 18:441,60412,028,0492,872,0001,139,0002,117,632stderr
3Jun 30, 2026 18:441,63511,934,0342,918,0001,171,0002,117,632stderr
4Jun 30, 2026 18:441,63612,017,4382,919,0001,173,0002,117,632stderr
5Jun 30, 2026 18:441,64312,025,9952,925,0001,184,0002,117,632stderr
6Jun 30, 2026 18:441,64712,075,5762,938,0001,181,0002,117,632stderr
7Jun 30, 2026 18:441,66811,965,0942,989,0001,181,0002,117,632stderr
8Jun 30, 2026 18:441,68012,116,3703,008,0001,194,0002,117,632stderr
9Jun 30, 2026 18:441,76412,292,6883,174,0001,236,0002,117,632stderr