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 21:24Dominique GarmierDominique GarmierScore: 187,418Success
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 03:06187,149947,288,251916,034,000998,0002,281,472
2Mar 27, 2026 03:06187,225949,114,701916,405,000999,0002,379,776
3Mar 27, 2026 21:24187,325946,944,040917,891,00002,281,472
4Mar 27, 2026 03:06187,418943,394,674917,347,000999,0002,273,280
5Mar 27, 2026 21:24187,430942,833,224916,409,0001,998,0002,387,968
6Mar 27, 2026 21:24187,448945,159,613916,499,0001,998,0002,281,472