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 23, 2026 08:05Dominique GarmierDominique GarmierScore: 315,453Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 08:53315,2231,572,842,4051,544,592,00002,281,472
2Mar 23, 2026 08:53315,2921,571,052,4441,543,933,000999,0002,281,472
3Mar 23, 2026 08:05315,4131,577,372,4151,543,528,0001,998,0002,273,280
4Mar 23, 2026 08:05315,4531,572,478,7421,543,724,0001,998,0002,379,776
5Mar 23, 2026 08:05315,6581,571,853,1501,545,726,000999,0002,273,280
6Mar 23, 2026 08:53315,7141,575,213,8191,545,000,0001,998,0002,281,472