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 21, 2026 03:01Dominique GarmierDominique GarmierScore: 531,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 03:01510,6472,531,107,1002,500,171,0001,998,0002,469,888
2Mar 21, 2026 03:01531,4552,636,698,5322,604,130,00002,478,080
3Mar 21, 2026 03:01535,6062,672,360,8112,621,470,0002,997,0002,306,048