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 27, 2026 18:25Dominique GarmierDominique GarmierScore: 1,919,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 18:251,918,7459,438,395,0979,400,853,000999,0002,289,664
2Mar 27, 2026 18:251,919,7229,433,047,0549,405,637,000999,0002,285,568
3Mar 27, 2026 18:251,919,8209,436,493,3489,405,117,0001,999,0002,289,664