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 listMar 24, 2026 09:28Dominique GarmierDominique GarmierScore: 230,303Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 19:50230,1921,152,958,9511,125,942,0001,998,0002,269,184
2Mar 24, 2026 09:28230,2161,158,027,5221,125,061,0002,997,0002,293,760
3Mar 23, 2026 19:50230,2731,160,890,8301,125,338,0002,998,0002,293,760
4Mar 24, 2026 09:28230,3031,152,083,2171,126,485,0001,999,0002,269,184
5Mar 23, 2026 19:50230,3821,158,363,0571,125,875,0002,997,0002,293,760
6Mar 24, 2026 09:28230,3921,153,480,1841,125,923,0002,997,0002,269,184