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 listSep 24, 2026 14:25Andrew EpsteinAndrew EpsteinScore: 291,293Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 14:25289,2351,427,739,7781,416,145,0001,109,0002,117,632stderr
2Sep 24, 2026 14:25289,9621,431,323,1331,419,717,0001,097,0002,117,632stderr
3Sep 24, 2026 14:25290,9441,436,947,4181,424,518,0001,111,0002,117,632stderr
4Sep 24, 2026 14:25291,1251,437,034,3671,425,406,0001,108,0002,117,632stderr
5Sep 24, 2026 14:25291,2931,437,810,4771,426,236,0001,100,0002,117,632stderr
6Sep 24, 2026 14:25292,0491,441,561,7511,429,934,0001,107,0002,117,632stderr
7Sep 24, 2026 14:25292,8821,445,674,1021,434,011,0001,111,0002,117,632stderr
8Sep 24, 2026 14:25292,8891,445,809,5661,434,045,0001,114,0002,117,632stderr
9Sep 24, 2026 14:25370,1221,824,246,7021,812,485,0001,115,0002,117,632stderr