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 21:28Victor MerckléVictor MerckléScore: 29,800Success
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 21:2829,669153,746,844144,372,0001,009,0002,117,632stderr
2Aug 24, 2026 21:2829,708153,961,659144,565,0001,008,0002,117,632stderr
3Aug 24, 2026 21:2829,741154,072,506144,724,0001,009,0002,117,632stderr
4Aug 24, 2026 21:2829,799154,370,033145,007,0001,010,0002,117,632stderr
5Aug 24, 2026 21:2829,800154,427,151145,016,0001,008,0002,117,632stderr
6Aug 24, 2026 21:2829,807154,484,440145,045,0001,010,0002,117,632stderr
7Aug 24, 2026 21:2829,811154,203,632144,065,0002,012,0002,117,632stderr
8Aug 24, 2026 21:2829,960155,230,869144,790,0002,016,0002,117,632stderr
9Aug 24, 2026 21:2829,965155,227,851145,820,0001,011,0002,117,632stderr