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 16:09Victor MerckléVictor MerckléScore: 30,226Success
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 16:1029,930155,032,076145,649,0001,009,0002,117,632stderr
2Aug 24, 2026 16:1029,939155,146,856145,692,0001,011,0002,117,632stderr
3Aug 24, 2026 16:1030,050155,597,117146,240,0001,009,0002,117,632stderr
4Aug 24, 2026 16:1030,106155,669,275145,499,0002,021,0002,117,632stderr
5Aug 24, 2026 16:1030,226156,477,005146,001,0002,109,0002,117,632stderr
6Aug 24, 2026 16:1030,323157,020,242146,575,0002,012,0002,117,632stderr
7Aug 24, 2026 16:1030,363157,051,011146,774,0002,007,0002,117,632stderr
8Aug 24, 2026 16:1030,513157,697,098148,505,0001,009,0002,117,632stderr
9Aug 24, 2026 16:1030,553159,261,405147,678,0002,033,0002,117,632stderr