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 22, 2026 09:19Dominique GarmierDominique GarmierScore: 864,206Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 09:19862,1264,251,872,6584,222,419,0001,998,0002,531,328
2Mar 22, 2026 19:48863,1864,254,581,7554,228,611,000999,0002,531,328
3Mar 22, 2026 19:48863,1954,258,459,6864,228,655,000999,0002,277,376
4Mar 22, 2026 09:19864,2064,257,951,2284,230,613,0003,997,0002,273,280
5Mar 22, 2026 09:19866,3814,272,295,6834,244,269,000999,0002,281,472
6Mar 22, 2026 19:48867,4544,276,301,6394,248,527,0001,998,0002,281,472