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 29, 2026 18:26Dominique GarmierDominique GarmierScore: 3,680,164Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 18:263,678,13218,055,556,73718,019,851,0002,998,0002,355,200
2Mar 29, 2026 18:263,680,16418,069,324,72318,030,804,0001,999,0002,281,472
3Mar 29, 2026 18:263,680,41818,067,588,46218,032,052,0001,998,0002,281,472