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:38Victor MerckléVictor MerckléScore: 32,667Success
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:3932,209166,285,104156,817,0001,011,0002,117,632stderr
2Aug 25, 2026 01:3932,334166,829,494157,430,0001,011,0002,117,632stderr
3Aug 25, 2026 01:3932,370167,063,778156,575,0002,039,0002,117,632stderr
4Aug 25, 2026 01:3932,610168,250,879158,782,0001,010,0002,117,632stderr
5Aug 25, 2026 01:3932,667168,469,422159,059,0001,010,0002,117,632stderr
6Aug 25, 2026 01:3932,796169,082,303159,692,0001,012,0002,117,632stderr
7Aug 25, 2026 01:3932,844169,339,622159,931,0001,008,0002,117,632stderr
8Aug 25, 2026 01:3933,730173,641,608164,273,0001,006,0002,117,632stderr
9Aug 25, 2026 01:3936,462187,132,919177,660,0001,005,0002,117,632stderr