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 25, 2026 01:02Victor MerckléVictor MerckléScore: 33,244Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 01:0233,150170,873,838161,425,0001,012,0002,117,632stderr
2Aug 25, 2026 01:0233,187171,018,160161,607,0001,011,0002,117,632stderr
3Aug 25, 2026 01:0233,193171,631,807161,634,0001,012,0002,117,632stderr
4Aug 25, 2026 01:0233,240171,325,772161,868,0001,012,0002,117,632stderr
5Aug 25, 2026 01:0233,244171,338,904161,885,0001,013,0002,117,632stderr
6Aug 25, 2026 01:0233,378171,943,156162,544,0001,011,0002,117,632stderr
7Aug 25, 2026 01:0233,424172,149,501162,768,0001,012,0002,117,632stderr
8Aug 25, 2026 01:0233,448172,343,161162,891,0001,005,0002,117,632stderr
9Aug 25, 2026 01:0233,513172,609,022163,208,0001,006,0002,117,632stderr