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 20, 2026 03:19Dominique GarmierDominique GarmierScore: 153,360Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 03:19152,009771,840,918742,845,0001,999,0002,265,088
2Mar 20, 2026 11:28152,485781,287,618745,180,0001,997,0002,330,624
3Mar 20, 2026 11:28153,170778,886,013748,537,0001,998,0002,469,888
4Mar 20, 2026 03:19153,360780,714,474750,463,000999,0002,461,696
5Mar 20, 2026 03:19153,632776,538,424751,800,000999,0002,273,280
6Mar 20, 2026 11:28154,867785,247,931756,847,0001,999,0002,457,600