Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listAug 24, 2026 19:53Victor MerckléVictor MerckléScore: 30,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 19:5329,688153,892,268143,450,0002,024,0002,117,632stderr
2Aug 24, 2026 19:5329,902154,902,734144,481,0002,039,0002,117,632stderr
3Aug 24, 2026 19:5329,957155,160,464144,781,0002,011,0002,117,632stderr
4Aug 24, 2026 19:5330,188156,261,346145,897,0002,027,0002,117,632stderr
5Aug 24, 2026 19:5330,189156,355,699145,822,0002,107,0002,117,632stderr
6Aug 24, 2026 19:5330,242156,356,193147,178,0001,011,0002,117,632stderr
7Aug 24, 2026 19:5330,271156,753,894146,303,0002,027,0002,117,632stderr
8Aug 24, 2026 19:5330,361157,518,481146,746,0002,024,0002,117,632stderr
9Aug 24, 2026 19:5330,362157,123,982146,758,0002,017,0002,117,632stderr