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 5, 2026 14:33olliecrowolliecrowScore: 8,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 14:368,45129,256,96616,796,0004,333,0002,449,408
2May 5, 2026 14:368,46329,266,76216,692,0004,467,0002,437,120
3May 5, 2026 14:368,48129,347,54316,832,0004,371,0002,428,928
4May 5, 2026 14:368,49629,338,30716,844,0004,396,0002,441,216
5May 5, 2026 14:368,53429,474,00716,752,0004,583,0002,428,928
6May 5, 2026 14:368,54629,430,29516,912,0004,455,0002,441,216
7May 5, 2026 14:368,58629,506,94216,960,0004,506,0002,453,504
8May 5, 2026 14:368,63729,607,39816,876,0004,717,0002,453,504
9May 5, 2026 14:368,85430,264,08417,322,0004,814,0002,408,448